DfsDefaultTraits< GR > Struct Template Reference

---

Detailed Description

template<class GR>
struct lemon::DfsDefaultTraits< GR >

Default traits class of Dfs class.

Parameters:

GR

Graph type.

#include <lemon/dfs.h>

List of all members.

Public Types
typedef GR	Graph
	The graph type the algorithm runs on.
typedef Graph::template NodeMap< typename GR::Edge >	PredMap
	The type of the map that stores the last edges of the DFS paths.
typedef NullMap< typename Graph::Node, bool >	ProcessedMap
	The type of the map that indicates which nodes are processed.
typedef Graph::template NodeMap< bool >	ReachedMap
	The type of the map that indicates which nodes are reached.
typedef Graph::template NodeMap< int >	DistMap
	The type of the map that stores the dists of the nodes.
Static Public Member Functions
static PredMap *	createPredMap (const GR &G)
	Instantiates a PredMap.
static ProcessedMap *	createProcessedMap (const GR &g)
	Instantiates a ProcessedMap.
static ReachedMap *	createReachedMap (const GR &G)
	Instantiates a ReachedMap.
static DistMap *	createDistMap (const GR &G)
	Instantiates a DistMap.

---

Member Typedef Documentation

typedef Graph::template NodeMap<typename GR::Edge> PredMap

The type of the map that stores the last edges of the DFS paths. It must meet the WriteMap concept.

typedef NullMap<typename Graph::Node,bool> ProcessedMap

The type of the map that indicates which nodes are processed. It must meet the WriteMap concept.

Todo:

named parameter to set this type, function to read and write.

typedef Graph::template NodeMap<bool> ReachedMap

The type of the map that indicates which nodes are reached. It must meet the WriteMap concept.

Todo:

named parameter to set this type, function to read and write.

typedef Graph::template NodeMap<int> DistMap

The type of the map that stores the dists of the nodes. It must meet the WriteMap concept.

---

Member Function Documentation

static PredMap* createPredMap

(

const GR &

G

)

[inline, static]

This function instantiates a PredMap.

Parameters:

G

is the graph, to which we would like to define the PredMap.

Todo:

The graph alone may be insufficient to initialize

static ProcessedMap* createProcessedMap

(

const GR &

g

)

[inline, static]

This function instantiates a ProcessedMap.

Parameters:

g

is the graph, to which we would like to define the ProcessedMap

static ReachedMap* createReachedMap

(

const GR &

G

)

[inline, static]

This function instantiates a ReachedMap.

Parameters:

G

is the graph, to which we would like to define the ReachedMap.

static DistMap* createDistMap

(

const GR &

G

)

[inline, static]

This function instantiates a DistMap.

Parameters:

G

is the graph, to which we would like to define the DistMap