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 Arc type 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 g to the vector et according to an Euler tour of g.

std::vector< ListDigraph::Arc > et;
for( DiEulerIt< ListDigraph > e( g ) ; e != INVALID ; ++e )
 et.push_back( e );
If g has no Euler tour, then the resulted walk will not be closed or not contain all arcs.

See also

EulerIt

Public Functions

inline DiEulerIt( const GR & gr , typename GR::Node start = INVALID )

Constructor.

Parameters:
  • gr – A digraph.

  • start – The starting point of the tour. If it is not given, the tour will start from the first node that has an outgoing arc.

inline operator Arc()

Arc conversion.

inline bool operator==(Invalid)

Compare with INVALID.

inline bool operator!=(Invalid)

Compare with INVALID.

inline DiEulerIt & operator++()

Next arc of the tour

inline Arc operator++(int)

Postfix incrementation.

Warning

This incrementation returns an Arc, not a DiEulerIt, as one may expect.