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 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 ()
	Constructor of the graph_edge_iterator class.
graph_edge_iterator &	operator++ ()
	Preincrement.
graph_edge_iterator	operator++ (int)
	Postincrement.
graph_edge_iterator &	operator-- ()
	Predecrement.
graph_edge_iterator	operator-- (int)
	postdecrement.
reference	operator* () const
	Reference.
pointer	operator-> () const
	Pointer.
bool	operator== (const graph_edge_iterator &it) const
	Equality.
bool	operator!= (const graph_edge_iterator &it) const
	Difference.

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.

Member Function Documentation

template<class S , class A , class Comp >

bool claw::graph< S, A, Comp >::graph_edge_iterator::operator!=

(

const graph_edge_iterator &

it

)

const

Difference.

Parameters

it	Iterator to compare to.

Precondition

Iterator and it are not at the end of their respective containers.

Definition at line 449 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator::reference claw::graph< S, A, Comp >::graph_edge_iterator::operator*

(

)

const

Reference.

Precondition

Iterator is not at the end of the container.

Definition at line 395 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator & claw::graph< S, A, Comp >::graph_edge_iterator::operator++

(

)

Preincrement.

Precondition

Iterator is not at the end of the container.

Definition at line 287 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator claw::graph< S, A, Comp >::graph_edge_iterator::operator++

(

int

)

Postincrement.

Precondition

Iterator is not at the end of the container.

Definition at line 323 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator & claw::graph< S, A, Comp >::graph_edge_iterator::operator--

(

)

Predecrement.

Precondition

Iterator is not at the begining of the container.

Definition at line 337 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator claw::graph< S, A, Comp >::graph_edge_iterator::operator--

(

int

)

postdecrement.

Precondition

Iterator is not at the begining of the container.

Definition at line 381 of file graph.tpp.

template<class S , class A , class Comp >

claw::graph< S, A, Comp >::graph_edge_iterator::pointer claw::graph< S, A, Comp >::graph_edge_iterator::operator->

(

)

const

Pointer.

Precondition

Iterator is not at the end of the container.

Definition at line 407 of file graph.tpp.

template<class S , class A , class Comp >

bool claw::graph< S, A, Comp >::graph_edge_iterator::operator==

(

const graph_edge_iterator &

it

)

const

Equality.

Parameters

it	Iterator to compare to.

Precondition

Iterator and it are not at the end of their respective containers.

Definition at line 420 of file graph.tpp.

---

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

• graph.hpp
• impl/graph.tpp