DijkstraDefaultTraits
Declared in lemon/dijkstra.h, in the group Shortest Path Algorithms; the same struct on the Doxygen site.
-
template< typename GR , typename LEN >
struct DijkstraDefaultTraits Default traits class of Dijkstra class.
- Template Parameters:
GR – The type of the digraph.
LEN – The type of the length map.
Public Types
-
typedef LEN LengthMap
The type of the map that stores the arc lengths. It must conform to the ReadMap concept.
-
typedef DijkstraDefaultOperationTraits< Value > OperationTraits
Operation traits for Dijkstra algorithm.
This class defines the operations that are used in the algorithm.
See also
-
typedef Digraph::template NodeMap< int > HeapCrossRef
The cross reference type used by the heap. Usually it is
Digraph::NodeMap< int >.
-
typedef BinHeap< typename LEN::Value , HeapCrossRef , std::less< Value > > Heap
The heap type used by the Dijkstra algorithm.
See also
See also
-
typedef Digraph::template NodeMap< typename Digraph::Arc > PredMap
The type of the map that stores the predecessor arcs of the shortest paths. It must conform to the WriteMap concept.
Public Static Functions
-
static inline HeapCrossRef * createHeapCrossRef( const Digraph & g )
Instantiates a
HeapCrossRef.This function instantiates a HeapCrossRef.
- Parameters:
g – is the digraph, to which we would like to define the HeapCrossRef.
-
static inline Heap * createHeap( HeapCrossRef & r )
Instantiates a
Heap.This function instantiates a Heap.
-
static inline PredMap * createPredMap( const Digraph & 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 ProcessedMap * createProcessedMap( const Digraph & g )
Instantiates a
ProcessedMap.This function instantiates a ProcessedMap.
- Parameters:
g – is the digraph, to which we would like to define the ProcessedMap.