Default traits class of Bfs class.
| GR | Digraph type. |
#include <lemon/bfs.h>
Public Types | |
| 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. More... | |
| typedef NullMap< typename Digraph::Node, bool > | ProcessedMap |
| The type of the map that indicates which nodes are processed. More... | |
| typedef Digraph::template NodeMap< bool > | ReachedMap |
| The type of the map that indicates which nodes are reached. More... | |
| typedef Digraph::template NodeMap< int > | DistMap |
| The type of the map that stores the distances of the nodes. More... | |
Static Public Member Functions | |
| static PredMap * | createPredMap (const Digraph &g) |
Instantiates a PredMap. More... | |
| static ProcessedMap * | createProcessedMap (const Digraph &g) |
Instantiates a ProcessedMap. More... | |
| static ReachedMap * | createReachedMap (const Digraph &g) |
Instantiates a ReachedMap. More... | |
| static DistMap * | createDistMap (const Digraph &g) |
Instantiates a DistMap. More... | |
| 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 |
| typedef Digraph::template NodeMap<bool> ReachedMap |
The type of the map that indicates which nodes are reached. It must conform to the ReadWriteMap concept.
| typedef Digraph::template NodeMap<int> DistMap |
The type of the map that stores the distances of the nodes. It must conform to the WriteMap concept.
|
inlinestatic |
This function instantiates a ProcessedMap.
| g | is the digraph, to which we would like to define the ProcessedMap |
|
inlinestatic |
This function instantiates a ReachedMap.
| g | is the digraph, to which we would like to define the ReachedMap. |
1.8.5