OutEdgeIt Class Reference

---

Detailed Description

This iterator goes trough the outgoing edges of a certain node of a graph. Its usage is quite simple, for example you can count the number of outgoing edges of a node n in graph g of type Graph as follows.

          int count=0;
          for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;

#include <lemon/concepts/ugraph.h>

Inheritance diagram for OutEdgeIt:

[legend]

List of all members.

Public Member Functions
	OutEdgeIt ()
	Default constructor.
	OutEdgeIt (const OutEdgeIt &e)
	OutEdgeIt (Invalid)
	OutEdgeIt (const UGraph &n, const Node &g)
	This constructor sets the iterator to the first outgoing edge.
	OutEdgeIt (const UGraph &, const Edge &)
	Edge -> OutEdgeIt conversion.
OutEdgeIt &	operator++ ()
	Next outgoing edge.

---

Constructor & Destructor Documentation

OutEdgeIt

(

)

[inline]

Warning:

The default constructor sets the iterator to an undefined value.

OutEdgeIt

(

const OutEdgeIt &

e

)

[inline]

Copy constructor.

OutEdgeIt

(

Invalid

)

[inline]

Initialize the iterator to be invalid.

OutEdgeIt	(	const UGraph &	n,
		const Node &	g
	)			[inline]

This constructor sets the iterator to the first outgoing edge of the node.

Parameters:

	n	the node
	g	the graph

OutEdgeIt	(	const UGraph &	,
		const Edge &
	)			[inline]

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

---

Member Function Documentation

OutEdgeIt& operator++

(

)

[inline]

Assign the iterator to the next outgoing edge of the corresponding node.