Digraph::ArcIt Class Reference

Detailed Description

This iterator goes through each arc of a digraph. Its usage is quite simple, for example you can count the number of arcs in a digraph g of type Digraph as follows:

int count=0;
for(Digraph::ArcIt e(g); e!=INVALID; ++e) ++count;

#include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::ArcIt:

Public Member Functions
	ArcIt ()
	Default constructor.
	ArcIt (const ArcIt &e)
	ArcIt (Invalid)
	ArcIt (const Digraph &g)
	This constructor sets the iterator to the first arc.
	ArcIt (const Digraph &, const Arc &)
	Arc -> ArcIt conversion.
ArcIt &	operator++ ()
	Next arc.
Public Member Functions inherited from Digraph::Arc
	Arc ()
	Default constructor.
	Arc (const Arc &)
	Arc (Invalid)
bool	operator== (Arc) const
	Equality operator.
bool	operator!= (Arc) const
	Inequality operator.
bool	operator< (Arc) const
	Artificial ordering operator.

Constructor & Destructor Documentation

ArcIt ( )

inline

Warning

The default constructor sets the iterator to an undefined value.

ArcIt ( const ArcIt &  e )

inline

Copy constructor.

ArcIt ( Invalid  )

inline

Initialize the iterator to be invalid.

ArcIt ( const Digraph &  g )

inline

This constructor sets the iterator to the first arc of g.

Parameters

g	the digraph

ArcIt ( const Digraph &  , const Arc &    )

inline

Sets the iterator to the value of the trivial iterator e. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.

Member Function Documentation

ArcIt& operator++ ( )

inline

Assign the iterator to the next arc.