Iterator class for getting edges from a FlowStatMap.
More...
|
LinkGraphJob & | job |
| Link graph job we're working with.
|
|
std::vector< NodeID > | station_to_node |
| Lookup table for getting NodeIDs from StationIDs.
|
|
FlowStat::SharesMap::const_iterator | it |
| Current iterator in the shares map.
|
|
FlowStat::SharesMap::const_iterator | end |
| End of the shares map.
|
|
Iterator class for getting edges from a FlowStatMap.
Definition at line 132 of file mcf.cpp.
◆ FlowEdgeIterator()
◆ Next()
NodeID FlowEdgeIterator::Next |
( |
| ) |
|
|
inline |
Get the next node for which a flow exists.
- Returns
- ID of next node with flow.
Definition at line 183 of file mcf.cpp.
◆ SetNode()
void FlowEdgeIterator::SetNode |
( |
NodeID |
source, |
|
|
NodeID |
node |
|
) |
| |
|
inline |
Setup the node to retrieve edges from.
- Parameters
-
source | Root of the current path tree. |
node | Current node to be checked for outgoing flows. |
Definition at line 166 of file mcf.cpp.
References FlowStat::empty_sharesmap, and it.
The documentation for this class was generated from the following file: