BellmanFordWizardDefaultTraits< _Graph, _LengthMap > Struct Template Reference


Detailed Description

template<typename _Graph, typename _LengthMap>
struct lemon::BellmanFordWizardDefaultTraits< _Graph, _LengthMap >

Default traits class of BellmanFord function.
Parameters:
_Graph Graph type.
_LengthMap Type of length map.
#include <lemon/bellman_ford.h>

List of all members.

Public Types

typedef _Graph Graph
 The graph type the algorithm runs on.
typedef _LengthMap LengthMap
 The type of the map that stores the edge lengths.
typedef _LengthMap::Value Value
 The value type of the length map.
typedef
BellmanFordDefaultOperationTraits
< Value
OperationTraits
 Operation traits for Bellman-Ford algorithm.
typedef NullMap< typename
_Graph::Node, typename
_Graph::Edge > 
PredMap
 The type of the map that stores the last edges of the shortest paths.
typedef NullMap< typename
Graph::Node, Value
DistMap
 The type of the map that stores the dists of the nodes.

Static Public Member Functions

static PredMapcreatePredMap (const _Graph &)
 Instantiates a PredMap.
static DistMapcreateDistMap (const _Graph &)
 Instantiates a DistMap.


Member Typedef Documentation

typedef _LengthMap LengthMap

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

It defines the infinity type on the given Value type and the used operation.

See also:
BellmanFordDefaultOperationTraits

typedef NullMap<typename _Graph::Node,typename _Graph::Edge> PredMap

The type of the map that stores the last edges of the shortest paths. It must meet the WriteMap concept.

typedef NullMap<typename Graph::Node, Value> DistMap

The type of the map that stores the dists of the nodes. It must meet the WriteMap concept.


Member Function Documentation

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

This function instantiates a PredMap.

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

This function instantiates a DistMap.


Generated on Thu Jun 4 04:03:20 2009 for LEMON by  doxygen 1.5.9