This class provides an efficient implementation of the DFS algorithm.
There is also a function-type interface for the DFS algorithm, which is convenient in the simplier cases and it can be used easier.
| GR | The type of the digraph the algorithm runs on. The default type is ListDigraph. |
| TR | The traits class that defines various types used by the algorithm. By default, it is DfsDefaultTraits<GR>. In most cases, this parameter should not be set directly, consider to use the named template parameters instead. |
#include <lemon/dfs.h>
Classes | |
| struct | SetDistMap |
Named parameter for setting DistMap type. More... | |
| struct | SetPredMap |
Named parameter for setting PredMap type. More... | |
| struct | SetProcessedMap |
Named parameter for setting ProcessedMap type. More... | |
| struct | SetReachedMap |
Named parameter for setting ReachedMap type. More... | |
| struct | SetStandardProcessedMap |
Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More... | |
Public Types | |
| typedef TR::Digraph | Digraph |
| The type of the digraph the algorithm runs on. | |
| typedef TR::PredMap | PredMap |
| The type of the map that stores the predecessor arcs of the DFS paths. | |
| typedef TR::DistMap | DistMap |
| The type of the map that stores the distances of the nodes. | |
| typedef TR::ReachedMap | ReachedMap |
| The type of the map that indicates which nodes are reached. | |
| typedef TR::ProcessedMap | ProcessedMap |
| The type of the map that indicates which nodes are processed. | |
|
typedef PredMapPath< Digraph, PredMap > | Path |
| The type of the paths. | |
| typedef TR | Traits |
| The traits class of the algorithm. | |
Public Member Functions | |
| Dfs (const Digraph &g) | |
| Constructor. More... | |
| ~Dfs () | |
| Destructor. | |
| Dfs & | predMap (PredMap &m) |
| Sets the map that stores the predecessor arcs. More... | |
| Dfs & | reachedMap (ReachedMap &m) |
| Sets the map that indicates which nodes are reached. More... | |
| Dfs & | processedMap (ProcessedMap &m) |
| Sets the map that indicates which nodes are processed. More... | |
| Dfs & | distMap (DistMap &m) |
| Sets the map that stores the distances of the nodes. More... | |
Execution Control | |
The simplest way to execute the DFS algorithm is to use one of the member functions called run(). | |
| void | init () |
| Initializes the internal data structures. More... | |
| void | addSource (Node s) |
| Adds a new source node. More... | |
| Arc | processNextArc () |
| Processes the next arc. More... | |
| OutArcIt | nextArc () const |
| Next arc to be processed. More... | |
| bool | emptyQueue () const |
Returns false if there are nodes to be processed. More... | |
| int | queueSize () const |
| Returns the number of the nodes to be processed. More... | |
| void | start () |
| Executes the algorithm. More... | |
| void | start (Node t) |
| Executes the algorithm until the given target node is reached. More... | |
| template<class ArcBoolMap > | |
| Arc | start (const ArcBoolMap &am) |
| Executes the algorithm until a condition is met. More... | |
| void | run (Node s) |
| Runs the algorithm from the given source node. More... | |
| bool | run (Node s, Node t) |
Finds the DFS path between s and t. More... | |
| void | run () |
| Runs the algorithm to visit all nodes in the digraph. More... | |
Query Functions | |
| Path | path (Node t) const |
| The DFS path to the given node. More... | |
| int | dist (Node v) const |
| The distance of the given node from the root(s). More... | |
| Arc | predArc (Node v) const |
| Returns the 'previous arc' of the DFS tree for the given node. More... | |
| Node | predNode (Node v) const |
| Returns the 'previous node' of the DFS tree for the given node. More... | |
| const DistMap & | distMap () const |
| Returns a const reference to the node map that stores the distances of the nodes. More... | |
| const PredMap & | predMap () const |
| Returns a const reference to the node map that stores the predecessor arcs. More... | |
| bool | reached (Node v) const |
| Checks if the given node. node is reached from the root(s). More... | |
|
inline |
|
inline |
|
inline |
Initializes the internal data structures.
|
inline |
Adds a new source node to the set of nodes to be processed.
|
inline |
Processes the next arc.
|
inline |
Next arc to be processed.
INVALID if the stack is empty.
|
inline |
Returns false if there are nodes to be processed in the queue (stack).
|
inline |
Returns the number of the nodes to be processed in the queue (stack).
|
inline |
Executes the algorithm.
This method runs the DFS algorithm from the root node in order to compute the DFS path to each node.
The algorithm computes
d.start() is just a shortcut of the following code.
|
inline |
Executes the algorithm until the given target node is reached.
This method runs the DFS algorithm from the root node in order to compute the DFS path to t.
The algorithm computes
t,t from the root in the DFS tree.
|
inline |
Executes the algorithm until a condition is met.
This method runs the DFS algorithm from the root node until an arc a with am[a] true is found.
| am | A bool (or convertible) arc map. The algorithm will stop when it reaches an arc a with am[a] true. |
a with am[a] true or INVALID if no such arc was found.
|
inline |
This method runs the DFS algorithm from node s in order to compute the DFS path to each node.
The algorithm computes
d.run(s) is just a shortcut of the following code.
|
inline |
This method runs the DFS algorithm from node s in order to compute the DFS path to node t (it stops searching when t is processed)
true if t is reachable form s.d.run(s,t) is just a shortcut of the following code.
|
inline |
This method runs the DFS algorithm in order to visit all nodes in the digraph.
d.run() is just a shortcut of the following code.
|
inline |
|
inline |
|
inline |
This function returns the 'previous arc' of the DFS tree for the node v, i.e. it returns the last arc of a DFS path from a root to v. It is INVALID if v is not reached from the root(s) or if v is a root.
The DFS tree used here is equal to the DFS tree used in predNode() and predMap().
|
inline |
|
inline |
|
inline |
1.8.5