CapacityScalingDefaultTraits

Declared in lemon/capacity_scaling.h, in the group Minimum Cost Flow Algorithms; the same struct on the Doxygen site.

template< typename GR , typename V = int , typename C = V >
struct CapacityScalingDefaultTraits

Default traits class of CapacityScaling algorithm.

Template Parameters:
  • GR – Digraph type.

  • V – The number type used for flow amounts, capacity bounds and supply values. By default it is int.

  • C – The number type used for costs and potentials. By default it is the same as V.

Public Types

typedef GR Digraph

The type of the digraph.

typedef V Value

The type of the flow amounts, capacity bounds and supply values.

typedef C Cost

The type of the arc costs.

typedef QuadHeap< Cost , RangeMap< int > > Heap

The type of the heap used for internal Dijkstra computations. It must conform to the Heap concept, its priority type must be Cost and its cross reference type must be RangeMap< int >. By default it is a 4-ary heap, whose fewer levels make the shortest path searches cheaper than on a binary heap [23].