Digraph::NodeIt Class Reference

Detailed Description

This iterator goes through each node of the digraph. Its usage is quite simple, for example, you can count the number of nodes in a digraph g of type Digraph like this:

int count=0;
for (Digraph::NodeIt n(g); n!=INVALID; ++n) ++count;

#include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::NodeIt:

Public Member Functions
	NodeIt ()
	Default constructor.
	NodeIt (const NodeIt &n)
	NodeIt (Invalid)
	Invalid constructor & conversion.
	NodeIt (const Digraph &)
	Sets the iterator to the first node.
	NodeIt (const Digraph &, const Node &)
	Sets the iterator to the given node.
NodeIt &	operator++ ()
	Next node.
Public Member Functions inherited from Digraph::Node
	Node ()
	Default constructor.
	Node (const Node &)
	Node (Invalid)
	Invalid constructor & conversion.
bool	operator== (Node) const
	Equality operator.
bool	operator!= (Node) const
bool	operator< (Node) const
	Artificial ordering operator.

Constructor & Destructor Documentation

NodeIt ( )

inline

Default constructor.

Warning

It sets the iterator to an undefined value.

NodeIt ( const NodeIt &  n )

inline

Copy constructor.

NodeIt ( Invalid  )

inline

Initializes the iterator to be invalid.

See Also

Invalid for more details.

NodeIt ( const Digraph &  )

inlineexplicit

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

NodeIt ( const Digraph &  , const Node &    )

inline

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

Member Function Documentation

NodeIt& operator++ ( )

inline

Assign the iterator to the next node.