ROSE
0.10.5.0

Vertex node.
These list nodes contain all information about a vertex and are the objects returned (by reference) when a vertex node iterator (VertexIterator or ConstVertexIterator) is dereferenced.
#include <Graph.h>
Public Member Functions  
const size_t &  id () const 
Unique vertex ID number. More...  
size_t  nInEdges () const 
Number of incoming edges. More...  
size_t  nOutEdges () const 
Number of outgoing edges. More...  
size_t  degree () const 
Number of incident edges. More...  
boost::iterator_range< EdgeIterator >  inEdges () 
List of incoming edges. More...  
boost::iterator_range< ConstEdgeIterator >  inEdges () const 
List of incoming edges. More...  
boost::iterator_range< EdgeIterator >  outEdges () 
List of outgoing edges. More...  
boost::iterator_range< ConstEdgeIterator >  outEdges () const 
List of outgoing edges. More...  
VertexValue &  value () 
Userdefined value. More...  
const VertexValue &  value () const 
Userdefined value. More...  

inline 
Unique vertex ID number.
Vertices within a graph are numbered consecutively starting at zero, and this method returns the vertex's ID number. ID numbers are unrelated to the order in which vertices are inserted, although in the absense of vertex erasure they will be assigned consecutively. Vertex ID numbers are stable over insertion of vertices and edges and the erasure of edges, but are not stable over vertex erasure. In order to obtain constanttime vertex erasure (at least when it has no incident edges), after a vertex is erased the largestID vertex is renumbered to fill the gap.
Time complexity is constant.
Definition at line 1190 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphCopySubgraph(), Sawyer::Container::Algorithm::graphDependentOrder(), Sawyer::Container::Algorithm::graphFindConnectedComponents(), Sawyer::Container::Algorithm::graphIsConnected(), and Sawyer::Container::Graph< AbstractLocation, DataFlowEdge >::operator=().

inline 
List of incoming edges.
Returns a sublist of edges whose target vertex is this vertex. The return value is a pair of iterators which delineate the edges. The traversal is in no particular order. Edge iterators are equalitycomparable with one another even when the come from different sublists. See EdgeIterator for details.
Time complexity is constant.
Definition at line 1201 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphFindConnectedComponents(), and Sawyer::Container::Algorithm::graphIsConnected().

inline 
List of incoming edges.
Returns a sublist of edges whose target vertex is this vertex. The return value is a pair of iterators which delineate the edges. The traversal is in no particular order. Edge iterators are equalitycomparable with one another even when the come from different sublists. See EdgeIterator for details.
Time complexity is constant.

inline 
List of outgoing edges.
Returns a sublist of edges whose source vertex is this vertex. The return value is a pair of iterators which delineate the edges. The traversal is in no particular order. Edge iterators are equalitycomparable with one another even when the come from different sublists. See EdgeIterator for details.
Time complexity is constant.
Definition at line 1222 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphCopySubgraph(), Sawyer::Container::Algorithm::graphDependentOrder(), Sawyer::Container::Algorithm::graphEraseParallelEdges(), Sawyer::Container::Algorithm::graphFindConnectedComponents(), and Sawyer::Container::Algorithm::graphIsConnected().

inline 
List of outgoing edges.
Returns a sublist of edges whose source vertex is this vertex. The return value is a pair of iterators which delineate the edges. The traversal is in no particular order. Edge iterators are equalitycomparable with one another even when the come from different sublists. See EdgeIterator for details.
Time complexity is constant.

inline 

inline 
Number of outgoing edges.
Returns the outdegree of this vertex, the length of the list returned by outEdges.
Definition at line 1244 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphEraseParallelEdges().

inline 

inline 
Userdefined value.
Each vertex stores one userdefined value whose type is specified as the V
parameter of the Graph template (a.k.a., the VertexValue type). This method returns a reference to that data, which was copied into the graph when this vertex was inserted. This is also the value that is returned when a vertex value iterator (VertexValueIterator or ConstVertexValueIterator) is dereferenced.
Time complexity is constant.
Definition at line 1266 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphCopySubgraph(), and Sawyer::Container::Graph< AbstractLocation, DataFlowEdge >::operator=().

inline 
Userdefined value.
Each vertex stores one userdefined value whose type is specified as the V
parameter of the Graph template (a.k.a., the VertexValue type). This method returns a reference to that data, which was copied into the graph when this vertex was inserted. This is also the value that is returned when a vertex value iterator (VertexValueIterator or ConstVertexValueIterator) is dereferenced.
Time complexity is constant.