31 #if defined(CUndirectedSimpleGraph_RECURSES)
32 #error Recursive header files inclusion detected in CUndirectedSimpleGraph.h
33 #else // defined(CUndirectedSimpleGraph_RECURSES)
35 #define CUndirectedSimpleGraph_RECURSES
37 #if !defined CUndirectedSimpleGraph_h
39 #define CUndirectedSimpleGraph_h
44 #include "DGtal/base/Common.h"
45 #include "DGtal/base/CConstSinglePassRange.h"
46 #include "DGtal/graph/CUndirectedSimpleLocalGraph.h"
101 template <
typename T>
139 #endif // !defined CUndirectedSimpleGraph_h
141 #undef CUndirectedSimpleGraph_RECURSES
142 #endif // else defined(CUndirectedSimpleGraph_RECURSES)
HalfEdgeDataStructure::Size Size
Aim: Defines the concept describing a const single pass range.
BOOST_CONCEPT_USAGE(CUndirectedSimpleGraph)
Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not neces...
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not neces...
void sameType(const T &, const T &)
HalfEdgeDataStructure::Edge Edge
void checkConstConstraints() const