DijkstraDefaultTraits Struct Template Reference

#include <lemon/dijkstra.h>

List of all members.


Detailed Description

template<class GR, class LM>
struct lemon::DijkstraDefaultTraits< GR, LM >

Default traits class of Dijkstra class.
Parameters:
GR Graph type.
LM Type of length map.


Public Types

typedef GR Graph
 The graph type the algorithm runs on.
typedef LM LengthMap
 The type of the map that stores the edge lengths.
typedef Graph::template NodeMap<
int > 
HeapCrossRef
 The cross reference type used by heap.
typedef BinHeap< typename
Graph::Node, typename LM::Value,
HeapCrossRef, std::less<
Value > > 
Heap
 The heap type used by Dijkstra algorithm.
typedef Graph::template NodeMap<
typename GR::Edge > 
PredMap
 The type of the map that stores the last edges of the shortest paths.
typedef NullMap< typename
Graph::Node, bool > 
ProcessedMap
 The type of the map that stores whether a nodes is processed.
typedef Graph::template NodeMap<
typename LM::Value > 
DistMap
 The type of the map that stores the dists of the nodes.

Static Public Member Functions

static HeapCrossRefcreateHeapCrossRef (const GR &G)
 Instantiates a HeapCrossRef.
static PredMapcreatePredMap (const GR &G)
 Instantiates a PredMap.
static ProcessedMapcreateProcessedMap (const GR &g)
 Instantiates a ProcessedMap.
static DistMapcreateDistMap (const GR &G)
 Instantiates a DistMap.


Member Typedef Documentation

typedef LM LengthMap
 

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

typedef Graph::template NodeMap<int> HeapCrossRef
 

The cross reference type used by heap. Usually it is Graph::NodeMap<int>.

typedef BinHeap<typename Graph::Node, typename LM::Value, HeapCrossRef, std::less<Value> > Heap
 

The heap type used by Dijkstra algorithm.

See also:
BinHeap

Dijkstra

typedef Graph::template NodeMap<typename GR::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,bool> ProcessedMap
 

The type of the map that stores whether a nodes is processed. It must meet the WriteMap concept. By default it is a NullMap.

Todo:
If it is set to a real map, Dijkstra::processed() should read this.

named parameter to set this type, function to read and write.

typedef Graph::template NodeMap<typename LM::Value> DistMap
 

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


Member Function Documentation

static HeapCrossRef* createHeapCrossRef const GR &  G  )  [inline, static]
 

This function instantiates a HeapCrossRef.

Parameters:
G is the graph, to which we would like to define the HeapCrossRef.

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

This function instantiates a PredMap.

Parameters:
G is the graph, to which we would like to define the PredMap.
Todo:
The graph alone may be insufficient for the initialization

static ProcessedMap* createProcessedMap const GR &  g  )  [inline, static]
 

This function instantiates a ProcessedMap.

Parameters:
g is the graph, to which we would like to define the ProcessedMap

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

This function instantiates a DistMap.

Parameters:
G is the graph, to which we would like to define the DistMap


The documentation for this struct was generated from the following file:
Generated on Fri Feb 3 18:40:57 2006 for LEMON by  doxygen 1.4.6