Default traits class used by DijkstraWizard.
| GR | The type of the digraph. | 
| LEN | The type of the length map. | 
#include <lemon/dijkstra.h>
 Inheritance diagram for DijkstraWizardBase< GR, LEN >:
 Inheritance diagram for DijkstraWizardBase< GR, LEN >:| Public Member Functions | |
| DijkstraWizardBase () | |
| Constructor.  More... | |
| DijkstraWizardBase (const GR &g, const LEN &l) | |
| Constructor.  More... | |
| Additional Inherited Members | |
|  Public Types inherited from DijkstraWizardDefaultTraits< GR, LEN > | |
| 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.  More... | |
| typedef LEN::Value | Value | 
| The type of the arc lengths. | |
| typedef DijkstraDefaultOperationTraits < Value > | OperationTraits | 
| Operation traits for Dijkstra algorithm.  More... | |
| typedef Digraph::template NodeMap< int > | HeapCrossRef | 
| The cross reference type used by the heap.  More... | |
| typedef BinHeap< Value, typename Digraph::template NodeMap< int >, std::less < Value > > | Heap | 
| The heap type used by the Dijkstra algorithm.  More... | |
| typedef Digraph::template NodeMap< typename Digraph::Arc > | PredMap | 
| The type of the map that stores the predecessor arcs of the shortest paths.  More... | |
| typedef NullMap< typename Digraph::Node, bool > | ProcessedMap | 
| The type of the map that indicates which nodes are processed.  More... | |
| typedef Digraph::template NodeMap< typename LEN::Value > | DistMap | 
| The type of the map that stores the distances of the nodes.  More... | |
| typedef lemon::Path< Digraph > | Path | 
| The type of the shortest paths.  More... | |
|  Static Public Member Functions inherited from DijkstraWizardDefaultTraits< GR, LEN > | |
| static HeapCrossRef * | createHeapCrossRef (const Digraph &g) | 
| Instantiates a HeapCrossRef.  More... | |
| static Heap * | createHeap (HeapCrossRef &r) | 
| Instantiates a Heap.  More... | |
| static PredMap * | createPredMap (const Digraph &g) | 
| Instantiates a PredMap.  More... | |
| static ProcessedMap * | createProcessedMap (const Digraph &g) | 
| Instantiates a ProcessedMap.  More... | |
| static DistMap * | createDistMap (const Digraph &g) | 
| Instantiates a DistMap.  More... | |
| 
 | inline | 
This constructor does not require parameters, therefore it initiates all of the attributes to 0. 
| 
 | inline | 
This constructor requires two parameters, others are initiated to 0. 
| g | The digraph the algorithm runs on. | 
| l | The length map. | 
 1.8.5
 1.8.5