DfsDefaultTraits

Declared in lemon/dfs.h, in the group Graph Search; the same struct on the Doxygen site.

template< class GR >
struct DfsDefaultTraits

Default traits class of Dfs class.

Template Parameters:

GR – Digraph type.

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. It must conform to the WriteMap concept.

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

The type of the map that indicates which nodes are processed. It must conform to the WriteMap concept. By default, it is a NullMap.

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.

Public Static Functions

static inline PredMap * createPredMap( const Digraph & g )

Instantiates a PredMap.

This function instantiates a PredMap.

Parameters:

g – is the digraph, to which we would like to define the PredMap.

static inline ProcessedMap * createProcessedMap( const Digraph & g )

Instantiates a ProcessedMap.

This function instantiates a ProcessedMap.

Parameters:

g – is the digraph, to which we would like to define the ProcessedMap.

static inline ReachedMap * createReachedMap( const Digraph & g )

Instantiates a ReachedMap.

This function instantiates a ReachedMap.

Parameters:

g – is the digraph, to which we would like to define the ReachedMap.

static inline DistMap * createDistMap( const Digraph & g )

Instantiates a DistMap.

This function instantiates a DistMap.

Parameters:

g – is the digraph, to which we would like to define the DistMap.