#include <Graph_boostV_p.hh>
Public Member Functions | |
virtual EdgeDescriptor * | clone () const |
EdgeDescriptor (const typename GRAPH::out_edge_iterator &cur_edge, const typename GRAPH::out_edge_iterator &neigh_end, const GRAPH &graph, const size_t nodeIndexShift) | |
virtual const std::string & | getEdgeLabel (void) const |
const Graph_Interface::IndexType & | getFromIndex (void) const |
const Graph_Interface::IndexType & | getToIndex (void) const |
virtual bool | operator!= (const EdgeDescriptor &ed) const |
virtual bool | operator!= (const Graph_Interface::EdgeDescriptor &ed) const |
virtual EdgeDescriptor & | operator++ () |
virtual bool | operator== (const EdgeDescriptor &ed) const |
virtual bool | operator== (const EdgeDescriptor &ed) const |
virtual | ~EdgeDescriptor () |
Destruction. More... | |
Protected Attributes | |
GRAPH::out_edge_iterator | cur_edge |
EdgeLabelMap | edgeLabelMap |
edge label access More... | |
Graph_Interface::IndexType | from |
the source of the edge described More... | |
const GRAPH & | graph |
access to the graph instance More... | |
GRAPH::out_edge_iterator | list_end |
NodeIndexMap | nodeIndexMap |
node index access More... | |
const size_t | nodeIndexShift |
the index shift to correct node indices to the global index More... | |
Graph_Interface::IndexType | to |
the target of the edge described More... | |
Special edge descriptor to enable the iteration over the edges contained in the internally used boost graph instance.
Definition at line 119 of file Graph_boostV_p.hh.
sgm::Graph_boostV_p< GRAPH, NODE_LABEL_PROPERTY, EDGE_LABEL_PROPERTY, NODE_INDEX_PROPERTY >::EdgeDescriptor::EdgeDescriptor | ( | const typename GRAPH::out_edge_iterator & | cur_edge, |
const typename GRAPH::out_edge_iterator & | neigh_end, | ||
const GRAPH & | graph, | ||
const size_t | nodeIndexShift | ||
) |
Construction of a new edge descriptor given the our edge iterators
cur_edge | the current boost edge iterator |
neigh_end | the end of the edge iteration |
graph | the graph instance the edge iterator is based on |
nodeIndexShift | index shift needed to correct node indices to the global index |
|
virtual |
Reimplemented from sgm::Graph_Interface::EdgeDescriptor.
|
virtual |
Create a heap copy of this object. NOTE: this has to be removed by the calling function.
Implements sgm::Graph_Interface::EdgeDescriptor.
|
virtual |
Access to the label of the edge.
Implements sgm::Graph_Interface::EdgeDescriptor.
|
inherited |
Access to the source of the edge.
|
inherited |
Access to the target of the edge.
|
virtual |
Inequality comparison
ed | the edge to compare to |
|
virtual |
Inequality comparison
ed | the edge to compare to |
Implements sgm::Graph_Interface::EdgeDescriptor.
|
virtual |
Iterator support
Implements sgm::Graph_Interface::EdgeDescriptor.
|
virtualinherited |
Equality comparison
ed | the edge to compare to |
|
virtual |
Equality comparison
ed | the edge to compare to |
|
protected |
the out edge iterator of the current target node within the local adjacency list
Definition at line 129 of file Graph_boostV_p.hh.
|
protected |
Definition at line 143 of file Graph_boostV_p.hh.
|
protectedinherited |
Definition at line 53 of file Graph_Interface.hh.
|
protected |
Definition at line 135 of file Graph_boostV_p.hh.
|
protected |
the edge iterator that marks the end of the local adjacency list
Definition at line 132 of file Graph_boostV_p.hh.
|
protected |
Definition at line 141 of file Graph_boostV_p.hh.
|
protected |
Definition at line 138 of file Graph_boostV_p.hh.
|
protectedinherited |
Definition at line 55 of file Graph_Interface.hh.