33 #if defined(DepthFirstVisitor_RECURSES)
34 #error Recursive header files inclusion detected in DepthFirstVisitor.h
35 #else // defined(DepthFirstVisitor_RECURSES)
37 #define DepthFirstVisitor_RECURSES
39 #if !defined DepthFirstVisitor_h
41 #define DepthFirstVisitor_h
47 #include "DGtal/base/Common.h"
48 #include "DGtal/base/CountedPtr.h"
49 #include "DGtal/base/ConstAlias.h"
50 #include "DGtal/kernel/sets/DigitalSetSelector.h"
51 #include "DGtal/kernel/sets/DigitalSetDomain.h"
52 #include "DGtal/topology/DomainAdjacency.h"
53 #include "DGtal/graph/CUndirectedSimpleLocalGraph.h"
93 template <
typename TGraph,
94 typename TMarkSet =
typename TGraph::VertexSet >
115 typedef std::pair< Vertex, Data >
Node;
165 template <
typename VertexIterator>
167 VertexIterator b, VertexIterator e );
214 template <
typename VertexPredicate>
215 void expand(
const VertexPredicate & authorized_vtx );
322 template <
typename TGraph,
typename TMarkSet >
332 #include "DGtal/graph/DepthFirstVisitor.ih"
337 #endif // !defined DepthFirstVisitor_h
339 #undef DepthFirstVisitor_RECURSES
340 #endif // else defined(DepthFirstVisitor_RECURSES)
void selfDisplay(std::ostream &out) const
Aim: This class encapsulates its parameter class so that to indicate to the user that the object/poin...
Size Data
Data attached to each Vertex is the depth distance to the seed.
DepthFirstVisitor< TGraph, TMarkSet > Self
std::vector< Vertex > VertexList
Internal data structure for storing vertices.
std::pair< Vertex, Data > Node
const MarkSet & markedVertices() const
const Graph & graph() const
HalfEdgeDataStructure::Size Size
void expand(const VertexPredicate &authorized_vtx)
DepthFirstVisitor & operator=(const DepthFirstVisitor &other)
DGtal is the top-level namespace which contains all DGtal functions and types.
std::stack< Node > NodeQueue
Internal data structure for computing the depth-first expansion.
std::ostream & operator<<(std::ostream &out, const ClosedIntegerHalfPlane< TSpace > &object)
MarkSet visitedVertices() const
DepthFirstVisitor(const DepthFirstVisitor &other)
Aim: This class is useful to perform a depth-first exploration of a graph given a starting point or s...
DepthFirstVisitor(ConstAlias< Graph > graph, VertexIterator b, VertexIterator e)
const Node & current() const
DepthFirstVisitor(ConstAlias< Graph > graph)
DepthFirstVisitor(ConstAlias< Graph > graph, const Vertex &p)