Graph edge iterator. More...
Graph edge iterator.
Definition at line 167 of file map_graph.hpp.
#include <map_graph.hpp>
Public Member Functions | |
edge_iterator (const Graph &g) | |
Constructor. | |
edge_iterator & | operator++ () |
Get the next element. | |
bool | isNext () |
Check if there is the next element. | |
edge_key | get () |
Get the actual key. | |
size_t | source () |
Return the source node. | |
size_t | target () |
Return the target node. | |
Private Attributes | |
const Graph & | g |
Graph. | |
edge_key | ek |
|
inline |
|
inline |
Get the actual key.
Get the actual key
Definition at line 247 of file map_graph.hpp.
|
inline |
Check if there is the next element.
Check if there is the next element
we did not reach the end of the node
we reach the end of the node
Definition at line 227 of file map_graph.hpp.
|
inline |
|
inline |
|
inline |
|
private |
Definition at line 173 of file map_graph.hpp.
|
private |
Graph.
Definition at line 170 of file map_graph.hpp.