| _Graph | Graph type. | |
| _CapacityMap | Type of capacity map. | 
#include <lemon/preflow.h>
| Public Types | |
| typedef _Graph | Graph | 
| The graph type the algorithm runs on. | |
| typedef _CapacityMap | CapacityMap | 
| The type of the map that stores the edge capacities. | |
| typedef CapacityMap::Value | Value | 
| The type of the length of the edges. | |
| typedef Graph::template EdgeMap< Value > | FlowMap | 
| The map type that stores the flow values. | |
| typedef LinkedElevator< Graph, typename Graph::Node > | Elevator | 
| The eleavator type used by Preflow algorithm. | |
| typedef lemon::Tolerance< Value > | Tolerance | 
| The tolerance used by the algorithm. | |
| Static Public Member Functions | |
| static FlowMap * | createFlowMap (const Graph &graph) | 
| Instantiates a FlowMap. | |
| static Elevator * | createElevator (const Graph &graph, int max_level) | 
| Instantiates an Elevator. | |
| typedef _CapacityMap CapacityMap | 
The type of the map that stores the edge capacities. It must meet the ReadMap concept.
The map type that stores the flow values. It must meet the ReadWriteMap concept.
| typedef LinkedElevator<Graph, typename Graph::Node> Elevator | 
| typedef lemon::Tolerance<Value> Tolerance | 
The tolerance used by the algorithm to handle inexact computation.
This function instantiates a FlowMap.
| graph | The graph, to which we would like to define the flow map. | 
This function instantiates a Elevator.
| graph | The graph, to which we would like to define the elevator. | |
| max_level | The maximum level of the elevator. | 
 1.5.9
 1.5.9