Default traits class of Dfs class.
GR | Digraph type. |
#include <lemon/dfs.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 DFS 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. | |
Static Public Member Functions | |
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 . |
typedef Digraph::template NodeMap<typename Digraph::Arc> PredMap |
The type of the map that stores the predecessor arcs of the DFS paths. It must meet the WriteMap concept.
typedef NullMap<typename Digraph::Node,bool> ProcessedMap |
The type of the map that indicates which nodes are processed. It must meet the WriteMap concept.
typedef Digraph::template NodeMap<bool> ReachedMap |
The type of the map that indicates which nodes are reached. It must meet the ReadWriteMap concept.
typedef Digraph::template NodeMap<int> DistMap |
The type of the map that stores the distances of the nodes. It must meet the WriteMap concept.
static ProcessedMap* createProcessedMap | ( | const Digraph & | g | ) | [inline, static] |
This function instantiates a ProcessedMap.
g | is the digraph, to which we would like to define the ProcessedMap. |
static ReachedMap* createReachedMap | ( | const Digraph & | g | ) | [inline, static] |
This function instantiates a ReachedMap.
g | is the digraph, to which we would like to define the ReachedMap. |