UEdgeIt Class Reference

---

Detailed Description

This iterator goes through each undirected edge of a graph. Its usage is quite simple, for example you can count the number of undirected edges in a graph g of type Graph as follows:

          int count=0;
          for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;

#include <lemon/concepts/ugraph.h>

Inheritance diagram for UEdgeIt:

[legend]

List of all members.

Public Member Functions
	UEdgeIt ()
	Default constructor.
	UEdgeIt (const UEdgeIt &e)
	UEdgeIt (Invalid)
	UEdgeIt (const UGraph &)
	UEdgeIt (const UGraph &, const UEdge &)
	UEdge -> UEdgeIt conversion.
UEdgeIt &	operator++ ()
	Next undirected edge.

---

Constructor & Destructor Documentation

UEdgeIt

(

)

[inline]

Warning:

The default constructor sets the iterator to an undefined value.

UEdgeIt

(

const UEdgeIt &

e

)

[inline]

Copy constructor.

UEdgeIt

(

Invalid

)

[inline]

Initialize the iterator to be invalid.

UEdgeIt

(

const UGraph &

)

[inline]

This constructor sets the iterator to the first undirected edge.

UEdgeIt	(	const UGraph &	,
		const UEdge &
	)			[inline]

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

---

Member Function Documentation

UEdgeIt& operator++

(

)

[inline]

Assign the iterator to the next undirected edge.