本文整理汇总了C++中GraphNode::getnodeid方法的典型用法代码示例。如果您正苦于以下问题：C++ GraphNode::getnodeid方法的具体用法？C++ GraphNode::getnodeid怎么用？C++ GraphNode::getnodeid使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类GraphNode的用法示例。
在下文中一共展示了GraphNode::getnodeid方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: printAdjacentNodes
void GraphNode :: printAdjacentNodes(){
for (int a =0; a< adjacents.size(); a++){
GraphNode * tmp = adjacents.at(a);
printf("neighbors %i 'th id is: %i \n", a, tmp->getnodeid());
}
}示例2: preprocess
void Graph :: preprocess(){
//we want all the edges to have pointer to the nodes its connecting
//we also want all nodes to know about its adjacency nodes
//we will do so by traversing all the edges
for (int e=0; e< edgelist.size(); e++) {
GraphEdge * thedg = edgelist.at(e);
int frid = thedg->from;
int toid = thedg->to;
bool foundfrom = false;
bool foundto = false;
GraphNode * fromend;
GraphNode * toend;
//find these nodes in the adjlist
for (int a=0; a<adjlist.size(); a++) {
GraphNode * nd = adjlist.at(a);
if (!foundfrom && nd->getnodeid() == frid) {
fromend = nd;
thedg->setFrom(fromend);
fromend->addAdjacentEdge(thedg);
foundfrom = true;
}
if (!foundto && nd->getnodeid() == toid) {
toend = nd;
thedg->setTo(toend);
toend->addAdjacentEdge(thedg);
foundto = true;
}
if(foundto && foundfrom){
fromend -> addAdjacentNode(toend);
toend->addAdjacentNode(fromend);
break;
}
}
}
}