Iterator on the graph's edges. More...
#include <graph.hpp>
Classes | |
| class | edge |
| Value pointed by the iterator. More... | |
Public Types | |
| typedef const edge | value_type |
| typedef const edge & | reference |
| typedef const edge *const | pointer |
| typedef ptrdiff_t | difference_type |
| typedef std::bidirectional_iterator_tag | iterator_category |
Public Member Functions | |
| graph_edge_iterator & | operator++ () |
| graph_edge_iterator | operator++ (int) |
| graph_edge_iterator & | operator-- () |
| graph_edge_iterator | operator-- (int) |
| reference | operator* () const |
| pointer | operator-> () const |
| bool | operator== (const graph_edge_iterator &it) const |
| bool | operator!= (const graph_edge_iterator &it) const |
Friends | |
| class | graph< vertex_type, edge_type, vertex_compare > |
Iterator on the graph's edges.
| typedef ptrdiff_t claw::graph< S, A, Comp >::graph_edge_iterator::difference_type |
| typedef std::bidirectional_iterator_tag claw::graph< S, A, Comp >::graph_edge_iterator::iterator_category |
| typedef const edge* const claw::graph< S, A, Comp >::graph_edge_iterator::pointer |
| typedef const edge& claw::graph< S, A, Comp >::graph_edge_iterator::reference |
| typedef const edge claw::graph< S, A, Comp >::graph_edge_iterator::value_type |
|
friend |