BpGraph::BlueNodeIt Class Reference

---

Detailed Description

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

          int count=0;
          for (BpGraph::BlueNodeIt n(g); n!=INVALID; ++n) ++count;

#include <lemon/concepts/bpgraph.h>

Inheritance diagram for BpGraph::BlueNodeIt:

List of all members.

Public Member Functions
	BlueNodeIt ()
	Default constructor.
	BlueNodeIt (const BlueNodeIt &n)
	BlueNodeIt (Invalid)
	Invalid constructor & conversion.
	BlueNodeIt (const BpGraph &)
	Sets the iterator to the first blue node.
	BlueNodeIt (const BpGraph &, const BlueNode &)
	Sets the iterator to the given blue node.
BlueNodeIt &	operator++ ()
	Next node.

---

Constructor & Destructor Documentation

BlueNodeIt

(

)

[inline]

Default constructor.

Warning:

It sets the iterator to an undefined value.

BlueNodeIt

(

const BlueNodeIt &

n

)

[inline]

Copy constructor.

BlueNodeIt

(

Invalid

)

[inline]

Initializes the iterator to be invalid.

See also:

Invalid for more details.

BlueNodeIt

(

const BpGraph &

)

[inline, explicit]

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

BlueNodeIt	(	const BpGraph &	,
		const BlueNode &
	)		[inline]

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

---

Member Function Documentation

BlueNodeIt& operator++

(

)

[inline]

Assign the iterator to the next blue node.