Iterator class for getting the edges in the order of their next_edge members.
More...
Detailed Description
Iterator class for getting the edges in the order of their next_edge members.
Definition at line 77 of file mcf.cpp.
Constructor & Destructor Documentation
GraphEdgeIterator::GraphEdgeIterator |
( |
LinkGraphJob & |
job |
) |
[inline] |
Member Function Documentation
NodeID GraphEdgeIterator::Next |
( |
|
) |
[inline] |
Retrieve the ID of the node the next edge points to.
- Returns:
- Next edge's target node ID or INVALID_NODE.
Definition at line 108 of file mcf.cpp.
References end, and i.
void GraphEdgeIterator::SetNode |
( |
NodeID |
source, |
|
|
NodeID |
node | |
|
) |
| | [inline] |
Setup the node to start iterating at.
- Parameters:
-
| source | Unused. |
| node | Node to start iterating at. |
Definition at line 98 of file mcf.cpp.
References end, i, and job.
The documentation for this class was generated from the following file: