Named parameter for setting ProcessedMap
type to be Digraph::NodeMap<bool>
. If you don't set it explicitly, it will be automatically allocated.
#include <lemon/dfs.h>
Additional Inherited Members | |
![]() | |
typedef SetStandardProcessedMapTraits::Digraph | Digraph |
The type of the digraph the algorithm runs on. | |
typedef SetStandardProcessedMapTraits::PredMap | PredMap |
The type of the map that stores the predecessor arcs of the DFS paths. | |
typedef SetStandardProcessedMapTraits::DistMap | DistMap |
The type of the map that stores the distances of the nodes. | |
typedef SetStandardProcessedMapTraits::ReachedMap | ReachedMap |
The type of the map that indicates which nodes are reached. | |
typedef SetStandardProcessedMapTraits::ProcessedMap | ProcessedMap |
The type of the map that indicates which nodes are processed. | |
typedef PredMapPath< Digraph, PredMap > | Path |
The type of the paths. | |
typedef SetStandardProcessedMapTraits | Traits |
The traits class of the algorithm. | |
![]() | |
Dfs (const Digraph &g) | |
Constructor. | |
~Dfs () | |
Destructor. | |
Dfs & | predMap (PredMap &m) |
Sets the map that stores the predecessor arcs. | |
Dfs & | reachedMap (ReachedMap &m) |
Sets the map that indicates which nodes are reached. | |
Dfs & | processedMap (ProcessedMap &m) |
Sets the map that indicates which nodes are processed. | |
Dfs & | distMap (DistMap &m) |
Sets the map that stores the distances of the nodes. | |
const PredMap & | predMap () const |
Returns a const reference to the node map that stores the predecessor arcs. | |
const DistMap & | distMap () const |
Returns a const reference to the node map that stores the distances of the nodes. | |
Path | path (Node t) const |
The DFS path to the given node. | |
int | dist (Node v) const |
The distance of the given node from the root(s). | |
Arc | predArc (Node v) const |
Returns the 'previous arc' of the DFS tree for the given node. | |
Node | predNode (Node v) const |
Returns the 'previous node' of the DFS tree for the given node. | |
bool | reached (Node v) const |
Checks if the given node. node is reached from the root(s). | |
void | init () |
void | addSource (Node s) |
Adds a new source node. | |
Arc | processNextArc () |
Processes the next arc. | |
OutArcIt | nextArc () const |
Next arc to be processed. | |
bool | emptyQueue () const |
Returns false if there are nodes to be processed. | |
int | queueSize () const |
Returns the number of the nodes to be processed. | |
void | start () |
Executes the algorithm. | |
void | start (Node t) |
Executes the algorithm until the given target node is reached. | |
Arc | start (const ArcBoolMap &am) |
Executes the algorithm until a condition is met. | |
void | run (Node s) |
Runs the algorithm from the given source node. | |
bool | run (Node s, Node t) |
Finds the DFS path between s and t . | |
void | run () |
Runs the algorithm to visit all nodes in the digraph. | |