#include <RuleGraph.hh>
Public Member Functions | |
virtual EdgeDescriptor * | clone () const |
EdgeDescriptor (const Rule::CoreGraph::out_edge_iterator &cur_edge, const Rule::CoreGraph::out_edge_iterator &neigh_end, const LeftSidePattern &parent) | |
virtual const std::string & | getEdgeLabel (void) const |
bool | operator!= (const EdgeDescriptor &ed) const |
bool | operator!= (const Graph_Interface::EdgeDescriptor &ed) const |
virtual EdgeDescriptor & | operator++ () |
bool | operator== (const EdgeDescriptor &ed) const |
virtual | ~EdgeDescriptor () |
Destruction. More... | |
Protected Attributes | |
Rule::CoreGraph::out_edge_iterator | cur_edge |
Rule::CoreGraph::out_edge_iterator | list_end |
const LeftSidePattern & | parent |
access to the parent instance for fast graph access More... | |
Special edge descriptor to enable the iteration over the edges contained in the internally used boost graph instance.
Definition at line 150 of file RuleGraph.hh.
ggl::LeftSidePattern::EdgeDescriptor::EdgeDescriptor | ( | const Rule::CoreGraph::out_edge_iterator & | cur_edge, |
const Rule::CoreGraph::out_edge_iterator & | neigh_end, | ||
const LeftSidePattern & | parent | ||
) |
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 |
parent | access to the parent instance for graph access |
|
virtual |
|
virtual |
Create a heap copy of this object. NOTE: this has to be removed by the calling function.
|
virtual |
Access to the label of the edge.
bool ggl::LeftSidePattern::EdgeDescriptor::operator!= | ( | const EdgeDescriptor & | ed | ) | const |
Inequality comparison
ed | the edge to compare to |
bool ggl::LeftSidePattern::EdgeDescriptor::operator!= | ( | const Graph_Interface::EdgeDescriptor & | ed | ) | const |
Inequality comparison
ed | the edge to compare to |
|
virtual |
Iterator support
bool ggl::LeftSidePattern::EdgeDescriptor::operator== | ( | const EdgeDescriptor & | ed | ) | const |
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 158 of file RuleGraph.hh.
|
protected |
the edge iterator that marks the end of the local adjacency list
Definition at line 161 of file RuleGraph.hh.
|
protected |
Definition at line 164 of file RuleGraph.hh.