BellmanFordDefaultTraits

Declared in lemon/bellman_ford.h, in the group Shortest Path Algorithms; the same struct on the Doxygen site.

template< typename GR , typename LEN >
struct BellmanFordDefaultTraits

Default traits class of BellmanFord class.

Template Parameters:
  • GR – The type of the digraph.

  • LEN – The type of the length map.

Public Types

typedef GR Digraph

The type of the digraph the algorithm runs on.

typedef LEN LengthMap

The type of the map that stores the arc lengths. It must conform to the ReadMap concept.

typedef LEN::Value Value

The type of the arc lengths.

typedef BellmanFordDefaultOperationTraits< Value > OperationTraits

Operation traits for Bellman-Ford algorithm.

It defines the used operations and the infinity value for the given Value type.

typedef GR::template NodeMap< typename GR::Arc > PredMap

The type of the map that stores the last arcs of the shortest paths. It must conform to the WriteMap concept.

typedef GR::template NodeMap< typename LEN::Value > DistMap

The type of the map that stores the distances of the nodes. It must conform to the WriteMap concept.

Public Static Functions

static inline PredMap * createPredMap( const GR & g )

Instantiates a PredMap.

This function instantiates a PredMap.

Parameters:

g – is the digraph to which we would like to define the PredMap.

static inline DistMap * createDistMap( const GR & g )

Instantiates a DistMap.

This function instantiates a DistMap.

Parameters:

g – is the digraph to which we would like to define the DistMap.