ConEdgeIt< _Graph > Class Template Reference
[Basic Graph Utilities]

---

Detailed Description

template<typename _Graph>
class lemon::ConEdgeIt< _Graph >

Iterator for iterating on edges connected the same nodes. It is higher level interface for the findEdge() function. You can use it the following way:

      for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
        ...
      }

See also:

findEdge()

EdgeLookUp

AllEdgeLookUp

DynEdgeLookUp

Author:

Balazs Dezso

#include <lemon/graph_utils.h>

List of all members.

Public Member Functions
	ConEdgeIt (const Graph &g, Node u, Node v)
	Constructor.
	ConEdgeIt (const Graph &g, Edge e)
	Constructor.
ConEdgeIt &	operator++ ()
	Increment operator.

---

Constructor & Destructor Documentation

ConEdgeIt	(	const Graph &	g,
		Node	u,
		Node	v
	)			[inline]

Construct a new ConEdgeIt iterating on the edges which connects the u and v node.

ConEdgeIt	(	const Graph &	g,
		Edge	e
	)			[inline]

Construct a new ConEdgeIt which continues the iterating from the e edge.

---

Member Function Documentation

ConEdgeIt& operator++

(

)

[inline]

It increments the iterator and gives back the next edge.