Digraph::NodeIt Class Reference

---

Detailed Description

This iterator goes through each node. Its usage is quite simple, for example you can count the number of nodes in 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:

List of all members.

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 &)
	Node -> NodeIt conversion.
NodeIt &	operator++ ()
	Next node.

---

Constructor & Destructor Documentation

NodeIt

(

)

[inline]

Warning:

The default constructor sets the iterator to an undefined value.

NodeIt

(

const NodeIt &

n

)

[inline]

Copy constructor.

NodeIt

(

Invalid

)

[inline]

Initialize the iterator to be invalid.

See also:

Invalid for more details.

NodeIt

(

const Digraph &

)

[inline]

Sets the iterator to the first node of g.

NodeIt	(	const Digraph &	,
		const Node &
	)		[inline]

Sets the iterator to the node of the digraph pointed by the trivial iterator. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.

---

Member Function Documentation

NodeIt& operator++

(

)

[inline]

Assign the iterator to the next node.