template<class NodeType, class EdgeType, class Visitor, class EdgePredicate = select_all>
slang::netlist::DepthFirstSearch class

Depth-first search on a directed graph. A visitor class provides visibility to the caller of visits to edges and nodes. An optional edge predicate selects which edges can be included in the traversal.

Constructors, destructors, conversion operators

DepthFirstSearch(Visitor& visitor, NodeType& startNode)
DepthFirstSearch(Visitor& visitor, EdgePredicate edgePredicate, NodeType& startNode)