template<class TR>
class lemon::DfsWizard< TR >
This auxiliary class is created to implement the function-type interface of Dfs algorithm. It does not have own run() method, it uses the functions and features of the plain Dfs.
This class should only be used through the dfs() function, which makes it easier to use the algorithm.
- Template Parameters
-
TR | The traits class that defines various types used by the algorithm. |
|
| DfsWizard () |
| Constructor.
|
|
| DfsWizard (const Digraph &g) |
| Constructor that requires parameters.
|
|
| DfsWizard (const TR &b) |
| Copy constructor.
|
|
void | run (Node s) |
| Runs DFS algorithm from the given source node.
|
|
bool | run (Node s, Node t) |
| Finds the DFS path between s and t .
|
|
void | run () |
| Runs DFS algorithm to visit all nodes in the digraph.
|
|
template<class T > |
DfsWizard< SetPredMapBase< T > > | predMap (const T &t) |
| Named parameter for setting the predecessor map.
|
|
template<class T > |
DfsWizard< SetReachedMapBase< T > > | reachedMap (const T &t) |
| Named parameter for setting the reached map.
|
|
template<class T > |
DfsWizard< SetDistMapBase< T > > | distMap (const T &t) |
| Named parameter for setting the distance map.
|
|
template<class T > |
DfsWizard< SetProcessedMapBase< T > > | processedMap (const T &t) |
| Named parameter for setting the processed map.
|
|
template<class T > |
DfsWizard< SetPathBase< T > > | path (const T &t) |
| Named parameter for getting the DFS path to the target node.
|
|
DfsWizard | dist (const int &d) |
| Named parameter for getting the distance of the target node.
|
|