Digraph::ArcIt Class Reference

Detailed Description

This iterator goes through each arc of the 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 a(g); a!=INVALID; ++a) ++count;

#include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::ArcIt:

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

Constructor & Destructor Documentation

ArcIt ( )

inline

Default constructor.

Warning

It sets the iterator to an undefined value.

ArcIt ( const ArcIt &  e )

inline

Copy constructor.

ArcIt ( Invalid  )

inline

Initializes the iterator to be invalid.

See Also

Invalid for more details.

ArcIt ( const Digraph &  g )

inlineexplicit

Sets the iterator to the first arc of the given digraph.

ArcIt ( const Digraph &  , const Arc &    )

inline

Sets the iterator to the given arc of the given digraph.

Member Function Documentation

ArcIt& operator++ ( )

inline

Assign the iterator to the next arc.