DijkstraWizardDefaultTraits
Declared in lemon/dijkstra.h, in the group Shortest Path Algorithms; the same struct on the Doxygen site.
-
template< class GR , class LEN >
struct DijkstraWizardDefaultTraits Default traits class of dijkstra() function.
- Template Parameters:
GR – The type of the digraph.
LEN – The type of the length map.
Subclassed by DijkstraWizardBase< GR , LEN >
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< Value , typename Digraph::template NodeMap< int > , 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.
-
typedef NullMap< typename Digraph::Node , bool > ProcessedMap
The type of the map that indicates which nodes are processed. It must conform to the WriteMap concept. By default, it is a NullMap.
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.
- Parameters:
r – is the HeapCrossRef which is used.
-
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.