#include <Graph_Interface.hh>
Generic constant iterator class to enumerate the edges between two nodes. It uses the OutEdge_iterator interface to perform the enumeration. For each edge an EdgeDescriptor is provided.
Definition at line 160 of file Graph_Interface.hh.
sgm::Graph_Interface::Edge_iterator::Edge_iterator |
( |
| ) |
|
Construction from data
- Parameters
-
curEdge | the begin of the outEdges to iterator |
edgeEnd | the end of the outEdges to iterator |
toIndex | the targeted index of the edges to be reported |
bool sgm::Graph_Interface::Edge_iterator::operator!= |
( |
const Edge_iterator & |
it | ) |
const |
Inequality comparison
- Returns
- true if both iterators are NOT pointing to the same edge
const EdgeDescriptor& sgm::Graph_Interface::Edge_iterator::operator* |
( |
| ) |
const |
access to the descriptive data of the current edge
- Returns
- the current edge data
Edge_iterator& sgm::Graph_Interface::Edge_iterator::operator++ |
( |
| ) |
|
Edge_iterator sgm::Graph_Interface::Edge_iterator::operator++ |
( |
int |
| ) |
|
const EdgeDescriptor* const sgm::Graph_Interface::Edge_iterator::operator-> |
( |
| ) |
const |
access to the descriptive data of the current edge
- Returns
- the current edge data
bool sgm::Graph_Interface::Edge_iterator::operator== |
( |
const Edge_iterator & |
it | ) |
const |
Equality comparison
- Returns
- true if both iterators are pointing to the same edge
const size_t sgm::Graph_Interface::Edge_iterator::toIndex |
|
protected |
The documentation for this class was generated from the following file: