#include <iterator.hpp>

Public Member Functions | |
| ilinks (const G &g) | |
create a link iterator for graph starting at link 0 | |
| ilinks (const G &g, int i) | |
create a link iterator for graph starting at link i | |
| ilinks & | operator++ () |
| advance to the next link | |
| ilinks & | operator-- () |
| go back to the previous link | |
| bool | valid () |
| check the iterator for link range violation | |
| link_type | operator[] (int i) |
| random access by link index | |
| link_type | operator* () |
| dereference returns the link identifier | |
Note, that in undirected_graph links are stored as pairs of directed, and ilinks will only give one part of the pair
1.5.6