Graph edge iterator.
More...
#include <map_graph.hpp>
template<typename Graph>
class edge_iterator< Graph >
Graph edge iterator.
Definition at line 167 of file map_graph.hpp.
◆ edge_iterator()
template<typename Graph >
◆ get()
template<typename Graph >
Get the actual key.
Get the actual key
- Returns
- the actual key
Definition at line 247 of file map_graph.hpp.
◆ isNext()
template<typename Graph >
Check if there is the next element.
Check if there is the next element
- Returns
- true if there is the next, false otherwise
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.
◆ operator++()
template<typename Graph >
◆ source()
template<typename Graph >
Return the source node.
- Returns
- the source node
Definition at line 257 of file map_graph.hpp.
◆ target()
template<typename Graph >
Return the target node.
- Returns
- the target node
Definition at line 267 of file map_graph.hpp.
The documentation for this class was generated from the following file: