graph
5.1.2
Graph: generic attributed relational graphs
|
The abstract base class for all types of edges; edges are created and managed by Graphs. More...
#include <graph/graph/edge.h>
Public Member Functions | |
Property querying methods | |
virtual bool | isDirected () const =0 |
Is this edge directed? More... | |
virtual bool | isUndirected () const =0 |
Is this edge undirected? More... | |
Iterators iterate on the vertices | |
iterator | begin () |
Get the beginning of the vertex collection of the graph. More... | |
iterator | end () |
Get the end of the vertex collection of the graph. More... | |
const_iterator | begin () const |
Get the beginning of the vertex collection of the graph. More... | |
const_iterator | end () const |
Get the end of the vertex collection of the graph. More... | |
reverse_iterator | rbegin () |
Get the beginning of the reversed vertex collection of the graph. More... | |
reverse_iterator | rend () |
Get the end of the reversed vertex collection of the graph. More... | |
const_reverse_iterator | rbegin () const |
Get the beginning of the reversed vertex collection of the graph. More... | |
const_reverse_iterator | rend () const |
Get the end of the reversed vertex collection of the graph. More... | |
virtual std::string | type () const CARTO_OVERRIDE |
Public Member Functions inherited from GraphObject | |
virtual | ~GraphObject () |
Public Member Functions inherited from carto::SyntaxedObject< class > | |
SyntaxedObject (const std::string &s) | |
SyntaxedObject (const SyntaxedObject &x) | |
SyntaxedObject (const SyntaxedObject< PropertySet > &x) | |
Associated types | |
typedef VSet::value_type | value_type |
typedef VSet::pointer | pointer |
typedef VSet::reference | reference |
typedef VSet::const_reference | const_reference |
typedef VSet::iterator | iterator |
typedef VSet::const_iterator | const_iterator |
typedef VSet::reverse_iterator | reverse_iterator |
typedef VSet::const_reverse_iterator | const_reverse_iterator |
Constructors, destructor | |
class | Graph |
export private method addVertices More... | |
virtual | ~Edge () |
Edge (std::string s) | |
The programmer should not call the constructor. More... | |
Edge (const Edge &x) | |
The programmer should not call the copy constructor. More... | |
virtual Edge * | cloneEdge () const =0 |
The programmer should not clone. More... | |
Vertex handling | |
bool | hasVertex (const Vertex *vertex) const |
Does this edge contain a given vertex? More... | |
size_t | verticesSize () const |
number of vertices More... | |
Additional Inherited Members | |
Public Types inherited from carto::SyntaxedObject< class > | |
typedef internal::SyntaxedObjectSwitch< T, SUPERSUBCLASS(Interface, T)>::ContentType | ContentType |
Protected Member Functions inherited from GraphObject | |
GraphObject (const std::string &s) | |
The programmer should not call the constructor of an abstract base class. More... | |
GraphObject (const GraphObject &x) | |
The abstract base class for all types of edges; edges are created and managed by Graphs.
Edge is the abstract base class for all types of edges, directed (D) or undirected (U). An Edge should contain at least one Vertex object. When the last vertex is removed from an edge, the edge is deleted by its graph owner.
See Graph for Edge creation.
typedef VSet::iterator Edge::iterator |
typedef VSet::pointer Edge::pointer |
typedef VSet::reference Edge::reference |
typedef VSet::value_type Edge::value_type |
|
virtual |
|
protected |
The programmer should not call the constructor.
s | syntactic attribute |
|
protected |
The programmer should not call the copy constructor.
x | edge to clone |
|
inline |
Get the beginning of the vertex collection of the graph.
Definition at line 318 of file edge.h.
References carto::block< class, N >::begin().
|
inline |
Get the beginning of the vertex collection of the graph.
Definition at line 334 of file edge.h.
References carto::block< class, N >::begin().
|
protectedpure virtual |
|
inline |
Get the end of the vertex collection of the graph.
Definition at line 326 of file edge.h.
References carto::block< class, N >::end().
|
inline |
Get the end of the vertex collection of the graph.
Definition at line 342 of file edge.h.
References carto::block< class, N >::end().
|
inline |
|
pure virtual |
|
pure virtual |
|
inline |
Get the beginning of the reversed vertex collection of the graph.
Definition at line 350 of file edge.h.
References carto::block< class, N >::rbegin().
|
inline |
Get the beginning of the reversed vertex collection of the graph.
Definition at line 366 of file edge.h.
References carto::block< class, N >::rbegin().
|
inline |
Get the end of the reversed vertex collection of the graph.
Definition at line 358 of file edge.h.
References carto::block< class, N >::rend().
|
inline |
Get the end of the reversed vertex collection of the graph.
Definition at line 374 of file edge.h.
References carto::block< class, N >::rend().
size_t Edge::verticesSize | ( | ) | const |
number of vertices