claw::graph< S, A, Comp >::graph_edge_iterator Class Reference

Iterator on the graph's edges. More...

#include <graph.hpp>

Classes
class	edge
	Value pointed by the iterator. More...

Public Types
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

Public Attributes
const typedef edge	value_type
const typedef edge &	reference
const typedef edge *const	pointer

Friends
class	graph< vertex_type, edge_type, vertex_compare >

Detailed Description

template<class S, class A = meta::no_type, class Comp = std::less<S>>
class claw::graph< S, A, Comp >::graph_edge_iterator

Iterator on the graph's edges.

Definition at line 144 of file graph.hpp.

---

The documentation for this class was generated from the following file:

• graph.hpp