CirculationDefaultTraits

Declared in lemon/circulation.h, in the group Maximum Flow Algorithms; the same struct on the Doxygen site.

template< typename GR , typename LM , typename UM , typename SM >
struct CirculationDefaultTraits

Default traits class of Circulation class.

Template Parameters:
  • GR – Type of the digraph the algorithm runs on.

  • LM – The type of the lower bound map.

  • UM – The type of the upper bound (capacity) map.

  • SM – The type of the supply map.

Public Types

typedef GR Digraph

The type of the digraph the algorithm runs on.

typedef LM LowerMap

The type of the lower bound map.

The type of the map that stores the lower bounds on the arcs. It must conform to the ReadMap concept.

typedef UM UpperMap

The type of the upper bound (capacity) map.

The type of the map that stores the upper bounds (capacities) on the arcs. It must conform to the ReadMap concept.

typedef SM SupplyMap

The type of supply map.

The type of the map that stores the signed supply values of the nodes. It must conform to the ReadMap concept.

typedef SupplyMap::Value Value

The type of the flow and supply values.

typedef GR::ArcMap< Value > FlowMap

The type of the map that stores the flow values. It must conform to the ReadWriteMap concept.

typedef lemon::Elevator< GR , GR::Node > Elevator

The elevator type used by the algorithm.

typedef lemon::Tolerance< Value > Tolerance

The tolerance used by the algorithm.

The tolerance used by the algorithm to handle inexact computation.

Public Static Functions

static inline FlowMap * createFlowMap( const Digraph & digraph )

Instantiates a FlowMap.

This function instantiates a FlowMap.

Parameters:

digraph – The digraph for which we would like to define the flow map.

static inline Elevator * createElevator( const Digraph & digraph , int max_level )

Instantiates an Elevator.

This function instantiates an Elevator.

Parameters:
  • digraph – The digraph for which we would like to define the elevator.

  • max_level – The maximum level of the elevator.