本文整理汇总了C++中PEdge::getToNode方法的典型用法代码示例。如果您正苦于以下问题：C++ PEdge::getToNode方法的具体用法？C++ PEdge::getToNode怎么用？C++ PEdge::getToNode使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类PEdge的用法示例。
在下文中一共展示了PEdge::getToNode方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: showGraph
void PGraph::showGraph(){
for(int i = 0; i < nodes.size(); i++){
cout<<nodes[i]->getIndex()<<endl;
for (PEdgeListIterator it = edges[i].begin(); it != edges[i].end(); ++it){
PEdge * e = *it;
cout<<" "<<e->getFromNode()<<","<<e->getToNode()<<endl;
}
}
}示例2:
list<PNode *> PGraph::getNeighbors(PNode* observer) {
int observerIndex = observer->getIndex();
PEdgeList edgesNeighbors = edges[observerIndex];
list<PNode *> neighbors;
for(PEdgeListIterator it = edgesNeighbors.begin(); it != edgesNeighbors.end(); ++it) {
PEdge * e = *it;
if (nodes[e->getFromNode()] != observer) {
neighbors.push_back(nodes[e->getFromNode()]);
}
else {
neighbors.push_back(nodes[e->getToNode()]);
}
}
return neighbors;
}