DGtal
1.5.beta
|
Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not necessarily know all the vertices. More...
#include <DGtal/graph/CUndirectedSimpleGraph.h>
Public Types | |
typedef T::Edge | Edge |
typedef T::Size | Size |
Public Types inherited from DGtal::concepts::CUndirectedSimpleLocalGraph< T > | |
typedef T::Vertex | Vertex |
typedef T::Size | Size |
typedef T::VertexSet | VertexSet |
Public Types inherited from DGtal::concepts::CConstSinglePassRange< T > | |
typedef T::ConstIterator | ConstIterator |
Public Member Functions | |
BOOST_CONCEPT_USAGE (CUndirectedSimpleGraph) | |
void | checkConstConstraints () const |
Public Member Functions inherited from DGtal::concepts::CUndirectedSimpleLocalGraph< T > | |
BOOST_CONCEPT_ASSERT ((CIntegralNumber< Size >)) | |
BOOST_CONCEPT_ASSERT ((boost::DefaultConstructible< Vertex >)) | |
BOOST_CONCEPT_ASSERT ((boost::Assignable< Vertex >)) | |
BOOST_CONCEPT_ASSERT ((boost::CopyConstructible< Vertex >)) | |
BOOST_CONCEPT_USAGE (CUndirectedSimpleLocalGraph) | |
void | checkConstConstraints () const |
Public Member Functions inherited from DGtal::concepts::CConstSinglePassRange< T > | |
BOOST_CONCEPT_ASSERT ((boost_concepts::SinglePassIteratorConcept< ConstIterator >)) | |
BOOST_CONCEPT_USAGE (CConstSinglePassRange) | |
void | checkConstConstraints () const |
Private Attributes | |
T | myX |
Size | mySize |
Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not necessarily know all the vertices.
Description of concept 'CUndirectedSimpleGraph'
CUndirectedSimpleLocalGraph, CSinglePassConstRange
The following types are defined in CSinglePassConstRange
The following types are defined in CUndirectedSimpleLocalGraph
X
: A type that is a model of CUndirectedSimpleGraphx
: object of type Xv
: object of type Vertexout
: an output iterator of type OutputIterator (model of boost::OutputIterator).p
: a predicate on vertex of type VertexPredicate (model of CVertexPredicate).Name | Expression | Type requirements | Return type | Precondition | Semantics | Post condition | Complexity |
---|---|---|---|---|---|---|---|
Size | x.size() | Size | Returns the number of vertices of this graph |
DigitalSurface, Object, IndexedDigitalSurface
T | the type that should be a model of CUndirectedSimpleGraph. |
Definition at line 102 of file CUndirectedSimpleGraph.h.
typedef T::Edge DGtal::concepts::CUndirectedSimpleGraph< T >::Edge |
Definition at line 109 of file CUndirectedSimpleGraph.h.
typedef T::Size DGtal::concepts::CUndirectedSimpleGraph< T >::Size |
Definition at line 110 of file CUndirectedSimpleGraph.h.
|
inline |
Definition at line 113 of file CUndirectedSimpleGraph.h.
References DGtal::concepts::CUndirectedSimpleGraph< T >::checkConstConstraints().
|
inline |
Definition at line 118 of file CUndirectedSimpleGraph.h.
References DGtal::concepts::CUndirectedSimpleGraph< T >::mySize, DGtal::concepts::CUndirectedSimpleGraph< T >::myX, and DGtal::concepts::ConceptUtils::sameType().
Referenced by DGtal::concepts::CUndirectedSimpleGraph< T >::BOOST_CONCEPT_USAGE().
|
private |
Definition at line 126 of file CUndirectedSimpleGraph.h.
Referenced by DGtal::concepts::CUndirectedSimpleGraph< T >::checkConstConstraints().
|
private |
Definition at line 125 of file CUndirectedSimpleGraph.h.
Referenced by DGtal::concepts::CUndirectedSimpleGraph< T >::checkConstConstraints().