Iterator class for getting the edges in the order of their next_edge members. More...
Public Member Functions | |
GraphEdgeIterator (LinkGraphJob *job) | |
Construct a GraphEdgeIterator. | |
void | SetNode (NodeID source, NodeID node) |
Setup the node to start iterating at. | |
NodeID | Next () |
Retrieve the ID of the node the next edge points to. | |
Private Attributes | |
LinkGraph * | graph |
Link graph we're working with. | |
NodeID | from |
Current "from" node. | |
NodeID | to |
Current edge's "to" node. |
Iterator class for getting the edges in the order of their next_edge members.
Definition at line 11 of file mcf.cpp.
GraphEdgeIterator::GraphEdgeIterator | ( | LinkGraphJob * | job | ) | [inline] |
Construct a GraphEdgeIterator.
job | Job to iterate on. |
NodeID GraphEdgeIterator::Next | ( | ) | [inline] |
Retrieve the ID of the node the next edge points to.
Definition at line 42 of file mcf.cpp.
References from, LinkGraph::GetEdge(), graph, Edge::next_edge, and to.
void GraphEdgeIterator::SetNode | ( | NodeID | source, | |
NodeID | node | |||
) | [inline] |