My Project
Loading...
Searching...
No Matches
BellmanFordWizardDefaultTraits< GR, LEN > Struct Template Reference

Detailed Description

template<typename GR, typename LEN>
struct lemon::BellmanFordWizardDefaultTraits< GR, LEN >

Default traits class of bellmanFord() function.

Template Parameters
GRThe type of the digraph.
LENThe 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< ValueOperationTraits
 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< ValueDistMap
 The type of the map that stores the distances of the nodes.
 
typedef lemon::Path< DigraphPath
 The type of the shortest paths.
 

Static Public Member Functions

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

Member Typedef Documentation

◆ LengthMap

template<typename GR , typename LEN >
LEN LengthMap

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

◆ OperationTraits

template<typename GR , typename LEN >
BellmanFordDefaultOperationTraits<Value> OperationTraits

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

See also
BellmanFordDefaultOperationTraits

◆ PredMap

template<typename GR , typename LEN >
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.

◆ DistMap

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

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

◆ Path

template<typename GR , typename LEN >
lemon::Path<Digraph> Path

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

Member Function Documentation

◆ createPredMap()

template<typename GR , typename LEN >
static PredMap * createPredMap ( const GR & g)
inlinestatic

This function instantiates a PredMap.

Parameters
gis the digraph to which we would like to define the PredMap.

◆ createDistMap()

template<typename GR , typename LEN >
static DistMap * createDistMap ( const GR & g)
inlinestatic

This function instantiates a DistMap.

Parameters
gis the digraph to which we would like to define the DistMap.