Iterator on edges.
More...
#include <edgeiter.h>
◆ EdgeIter()
Constructor.
- Parameters
-
g | : Reference to the Graph object |
◆ begin()
Init.
Initialize (or re-initialize) the iterator.
- Returns
- an instance of the iterator
Implements libgexf::AbstractIter.
◆ currentProperty()
Get topological property value.
- Parameters
-
prop | : Topological edge property name |
- Returns
- Property value or 0.0 by default
◆ currentSource()
t_id libgexf::EdgeIter::currentSource |
( |
| ) |
const |
Get source node.
- Returns
- The node id of the source
◆ currentTarget()
t_id libgexf::EdgeIter::currentTarget |
( |
| ) |
const |
Get target node.
- Returns
- The node id of the target
◆ hasNext()
bool libgexf::EdgeIter::hasNext |
( |
| ) |
const |
|
virtual |
Test next element in collection.
Verify if another element exists.
- Returns
- true if another element exists, false otherwise.
Implements libgexf::AbstractIter.
◆ next()
t_id libgexf::EdgeIter::next |
( |
| ) |
|
|
virtual |
The documentation for this class was generated from the following files: