DGtal
0.6.devel
|
#include <CUndirectedSimpleGraph.h>
Public Types | |
typedef T::Edge | Edge |
typedef T::Size | Size |
![]() | |
typedef T::Vertex | Vertex |
typedef T::VertexSet | VertexSet |
![]() | |
typedef T::ConstIterator | ConstIterator |
Public Member Functions | |
BOOST_CONCEPT_USAGE (CUndirectedSimpleGraph) | |
void | checkConstConstraints () const |
![]() | |
BOOST_CONCEPT_ASSERT ((CInteger< Size >)) | |
BOOST_CONCEPT_USAGE (CUndirectedSimpleLocalGraph) | |
![]() | |
BOOST_CONCEPT_ASSERT ((boost_concepts::SinglePassIteratorConcept< ConstIterator >)) | |
BOOST_CONCEPT_USAGE (CConstSinglePassRange) |
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'
- Edge: the type for the edges of the graph. The following types are defined in CSinglePassConstRange - ConstIterator: const iterator on Vertex The following types are defined in CUndirectedSimpleLocalGraph - Size: an integral type to count the number of vertices. - Vertex: the type for the vertices of the graph. - VertexSet: the type for storing a set of vertices. - VertexMap: a rebinding structure to associate Value to vertices of model CVertexMap.
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 | Postcondition | Complexity |
Size | x.size() | Size | Returns the number of vertices of this graph. |
- DigitalSurface, Object
T | the type that should be a model of CUndirectedSimpleGraph. |
Definition at line 121 of file CUndirectedSimpleGraph.h.
typedef T::Edge DGtal::CUndirectedSimpleGraph< T >::Edge |
Definition at line 132 of file CUndirectedSimpleGraph.h.
typedef T::Size DGtal::CUndirectedSimpleGraph< T >::Size |
Reimplemented from DGtal::CUndirectedSimpleLocalGraph< T >.
Definition at line 133 of file CUndirectedSimpleGraph.h.
|
inline |
Definition at line 136 of file CUndirectedSimpleGraph.h.
References DGtal::CUndirectedSimpleGraph< T >::checkConstConstraints().
|
inline |
Reimplemented from DGtal::CUndirectedSimpleLocalGraph< T >.
Definition at line 141 of file CUndirectedSimpleGraph.h.
References DGtal::CUndirectedSimpleGraph< T >::mySize, DGtal::CUndirectedSimpleGraph< T >::myX, and DGtal::ConceptUtils::sameType().
Referenced by DGtal::CUndirectedSimpleGraph< T >::BOOST_CONCEPT_USAGE().
|
private |
Reimplemented from DGtal::CUndirectedSimpleLocalGraph< T >.
Definition at line 149 of file CUndirectedSimpleGraph.h.
Referenced by DGtal::CUndirectedSimpleGraph< T >::checkConstConstraints().
|
private |
Reimplemented from DGtal::CUndirectedSimpleLocalGraph< T >.
Definition at line 148 of file CUndirectedSimpleGraph.h.
Referenced by DGtal::CUndirectedSimpleGraph< T >::checkConstConstraints().