Detailed Description

Default traits class of bellmanFord() function.

Template Parameters:

GR	The type of the digraph.
LEN	The type of the length map.

#include <lemon/bellman_ford.h>

Inheritance diagram for BellmanFordWizardDefaultTraits< GR, LEN >:

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.
typedef LEN::Value	Value
	The type of the arc lengths.
typedef BellmanFordDefaultOperationTraits < Value >	OperationTraits
	Operation traits for Bellman-Ford algorithm.
typedef GR::template NodeMap < typename GR::Arc >	PredMap
	The type of the map that stores the last arcs of the shortest paths.
typedef GR::template NodeMap < Value >	DistMap
	The type of the map that stores the distances of the nodes.
typedef lemon::Path< Digraph >	Path
	The type of the shortest paths.
Static Public Member Functions
static PredMap *	createPredMap (const GR &g)
	Instantiates a `PredMap`.
static DistMap *	createDistMap (const GR &g)
	Instantiates a `DistMap`.

Member Typedef Documentation

typedef LEN LengthMap

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

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<Value> DistMap

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

The type of the shortest paths. It must meet the Path concept.

static PredMap* createPredMap ( const GR & g ) [inline, static]

This function instantiates a PredMap.

Parameters:

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

static DistMap* createDistMap ( const GR & g ) [inline, static]

This function instantiates a DistMap.

Parameters:

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