Default traits class used by BfsWizard.
GR | The type of the digraph. |
#include <lemon/bfs.h>
Public Member Functions | |
BfsWizardBase () | |
Constructor. | |
BfsWizardBase (const GR &g) | |
Constructor. | |
Additional Inherited Members | |
![]() | |
typedef GR | Digraph |
The type of the digraph the algorithm runs on. | |
typedef Digraph::template NodeMap< typename Digraph::Arc > | PredMap |
The type of the map that stores the predecessor arcs of the shortest paths. | |
typedef NullMap< typename Digraph::Node, bool > | ProcessedMap |
The type of the map that indicates which nodes are processed. | |
typedef Digraph::template NodeMap< bool > | ReachedMap |
The type of the map that indicates which nodes are reached. | |
typedef Digraph::template NodeMap< int > | DistMap |
The type of the map that stores the distances of the nodes. | |
typedef lemon::Path< Digraph > | Path |
The type of the shortest paths. | |
![]() | |
static PredMap * | createPredMap (const Digraph &g) |
Instantiates a PredMap. | |
static ProcessedMap * | createProcessedMap (const Digraph &g) |
Instantiates a ProcessedMap. | |
static ReachedMap * | createReachedMap (const Digraph &g) |
Instantiates a ReachedMap. | |
static DistMap * | createDistMap (const Digraph &g) |
Instantiates a DistMap. | |
|
inline |
This constructor does not require parameters, it initiates all of the attributes to 0
.
|
inline |
This constructor requires one parameter, others are initiated to 0
.
g | The digraph the algorithm runs on. |