DiEulerIt
Declared in lemon/euler.h, in the group Connectivity and Other Graph Properties; the same class on the Doxygen site.
-
template< typename GR >
class DiEulerIt Euler tour iterator for digraphs.
This iterator provides an Euler tour (Eulerian circuit) of a directed graph (if there exists) and it converts to the
Arctype of the digraph.For example, if the given digraph has an Euler tour (i.e it has only one non-trivial component and the in-degree is equal to the out-degree for all nodes), then the following code will put the arcs of
gto the vectoretaccording to an Euler tour ofg.Ifstd::vector< ListDigraph::Arc > et; for( DiEulerIt< ListDigraph > e( g ) ; e != INVALID ; ++e ) et.push_back( e );
ghas no Euler tour, then the resulted walk will not be closed or not contain all arcs.See also