Iterator class for getting edges from a FlowStatMap.  
 More...
| 
Public Member Functions | 
|  | FlowEdgeIterator (LinkGraphJob &job) | 
|  | Constructor. 
 | 
| void | SetNode (NodeID source, NodeID node) | 
|  | Setup the node to retrieve edges from. 
 | 
| NodeID | Next () | 
|  | Get the next node for which a flow exists. 
 | 
| 
Private Attributes | 
| 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. 
 | 
Detailed Description
Iterator class for getting edges from a FlowStatMap. 
Definition at line 134 of file mcf.cpp.
Constructor & Destructor Documentation
Member Function Documentation
  
  | 
        
          | NodeID FlowEdgeIterator::Next | ( |  | ) |  |  | inline | 
 
Get the next node for which a flow exists. 
- Returns
- ID of next node with flow. 
Definition at line 185 of file mcf.cpp.
References end, it, and station_to_node.
 
 
  
  | 
        
          | 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 168 of file mcf.cpp.
References FlowStat::empty_sharesmap, end, it, and job.
 
 
Field Documentation
  
  | 
        
          | FlowStat::SharesMap::const_iterator FlowEdgeIterator::end |  | private | 
 
 
  
  | 
        
          | FlowStat::SharesMap::const_iterator FlowEdgeIterator::it |  | private | 
 
 
  
  | 
        
          | std::vector<NodeID> FlowEdgeIterator::station_to_node |  | private | 
 
 
The documentation for this class was generated from the following file: