_Graph | Graph type. | |
_CapacityMap | Type of capacity map. |
#include <lemon/circulation.h>
Public Types | |
typedef _Graph | Graph |
The graph type the algorithm runs on. | |
typedef _LCapMap | LCapMap |
The type of the map that stores the circulation lower bound. | |
typedef _UCapMap | UCapMap |
The type of the map that stores the circulation upper bound. | |
typedef _DeltaMap | DeltaMap |
The type of the map that stores the upper bound of node excess. | |
typedef DeltaMap::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 lemon::Elevator< Graph, typename Graph::Node > | Elevator |
The eleavator type used by Circulation 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 _LCapMap LCapMap |
The type of the map that stores the circulation lower bound. It must meet the ReadMap concept.
typedef _UCapMap UCapMap |
The type of the map that stores the circulation upper bound. It must meet the ReadMap concept.
typedef _DeltaMap DeltaMap |
The type of the map that stores the lower bound of node excess. It must meet the ReadMap concept.
The map type that stores the flow values. It must meet the ReadWriteMap concept.
typedef lemon::Elevator<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. |