All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
List of all members | Public Member Functions
DfsWizardBase< GR > Class Template Reference

Detailed Description

template<class GR>
class lemon::DfsWizardBase< GR >

To make it easier to use Dfs algorithm we have created a wizard class. This DfsWizard class needs default traits, as well as the Dfs class. The DfsWizardBase is a class to be the default traits of the DfsWizard class.

#include <lemon/dfs.h>

+ Inheritance diagram for DfsWizardBase< GR >:

Public Member Functions

 DfsWizardBase ()
 Constructor.
 
 DfsWizardBase (const GR &g)
 Constructor.
 

Additional Inherited Members

- Public Types inherited from DfsWizardDefaultTraits< GR >
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.
 
typedef lemon::Path< DigraphPath
 The type of the DFS paths.
 
- Static Public Member Functions inherited from DfsWizardDefaultTraits< GR >
static PredMapcreatePredMap (const Digraph &g)
 Instantiates a PredMap.
 
static ProcessedMapcreateProcessedMap (const Digraph &g)
 Instantiates a ProcessedMap.
 
static ReachedMapcreateReachedMap (const Digraph &g)
 Instantiates a ReachedMap.
 
static DistMapcreateDistMap (const Digraph &g)
 Instantiates a DistMap.
 

Constructor & Destructor Documentation

DfsWizardBase ( )
inline

This constructor does not require parameters, therefore it initiates all of the attributes to 0.

DfsWizardBase ( const GR &  g)
inline

This constructor requires one parameter, others are initiated to 0.

Parameters
gThe digraph the algorithm runs on.