graphgen::undirected_graph::idepth Class Reference

Depth first search iterator. More...

#include <iterator.hpp>

Collaboration diagram for graphgen::undirected_graph::idepth:

[legend]

List of all members.

Public Member Functions
	idepth (const undirected_graph &g, vertex_type root)
	create depth first iterator for graph and specified root/start vertex
	idepth (const undirected_graph &g)
	create depth first iterator for graph and root vertex 0
vertex_type	operator* () const
	dereference returns the vertex identifier of the actual vertex
idepth &	operator++ ()
	advance to the next vertex in the depth first sequence
bool	operator== (idepth &rhs) const
	comparison of iterators returns true if both point to the same vertex of the same graph object.
link_type	via () const
	return the link that lead to the actual vertex
bool	valid () const
	test the iterator validity.

---

Detailed Description

Depth first search iterator.

While iterating, all vertices of the given connected subgraph will be visited according to the depth first search algorithm.

---

Member Function Documentation

bool graphgen::undirected_graph::idepth::operator==

(

idepth &

rhs

)

const [inline]

comparison of iterators returns true if both point to the same vertex of the same graph object.

Note that, for this iterator, this does not imply identical iteration sequences of the operands

References graph, and vertex.

bool graphgen::undirected_graph::idepth::valid

(

)

const [inline]

test the iterator validity.

Use this to avoid vertex identifier range violation

---

The documentation for this class was generated from the following file:

• iterator.hpp