ROSE
0.9.13.77

Edge node.
These list nodes contain all information about an edge and are the objects returned (by reference) when an edge node iterator (EdgeIterator or ConstEdgeIterator) is dereferenced.
#include <Graph.h>
Public Member Functions  
const size_t &  id () const 
Unique edge ID number. More...  
bool  isSelfEdge () const 
Determines if edge is a selfedge. More...  
const VertexIterator &  source () 
Source vertex. More...  
ConstVertexIterator  source () const 
Source vertex. More...  
const VertexIterator &  target () 
Target vertex. More...  
ConstVertexIterator  target () const 
Target vertex. More...  
EdgeValue &  value () 
Userdefined value. More...  
const EdgeValue &  value () const 
Userdefined value. More...  

inline 
Unique edge ID number.
Edges within a graph are numbered consecutively starting at zero, and this method returns the edge's ID number. ID numbers are unrelated to the order in which edges are inserted, although in the absense of edge erasure they will be assigned consecutively. Edge ID numbers are stable over insertion of vertices and edges and the erasure of vertices (provided no incident edges are erase), but are not stable over edge erasure. In order to obtain constanttime edge erasure, after an edge is erased the largestID edge is renumbered to fill the gap.
Time complexity is constant.

inline 
Source vertex.
All edges in a graph are directed edges, and this method returns an iterator (pointer) to the vertex that serves as the source of this edge.
Time complexity is constant.
Definition at line 1127 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphFindConnectedComponents(), Sawyer::Container::Algorithm::graphIsConnected(), and Sawyer::Container::Graph< AbstractLocation, DataFlowEdge >::operator=().

inline 

inline 
Target vertex.
All edges in a graph are directed edges, and this method returns an iterator (pointer) to the vertex that serves as the destination of this edge.
Time complexity is constant.
Definition at line 1139 of file Graph.h.
Referenced by Sawyer::Container::Algorithm::graphCopySubgraph(), Sawyer::Container::Algorithm::graphDependentOrder(), Sawyer::Container::Algorithm::graphEraseParallelEdges(), Sawyer::Container::Algorithm::graphFindConnectedComponents(), Sawyer::Container::Algorithm::graphIsConnected(), and Sawyer::Container::Graph< AbstractLocation, DataFlowEdge >::operator=().

inline 

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

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

inline 