#include <lemon/euler.h>
Edge
type of the graph and using operator ++ it provides an Euler tour of the graph (if there exists).
For example if the given graph if Euler (i.e it has only one nontrivial component and the degree of each node is even), the following code will print the edge IDs according to an Euler tour of g
.
for(UEulerIt<ListUGraph> e(g),e!=INVALID;++e) { std::cout << g.id(UEdge(e)) << std::eol; }
If g
is not Euler then the resulted tour will not be full or closed.
Public Member Functions | |
UEulerIt (const Graph &_g, typename Graph::Node start=INVALID) | |
Constructor. | |
operator Edge () | |
Edge Conversion. | |
UEulerIt & | operator++ () |
Next edge of the tour. | |
Edge | operator++ (int) |
Postfix incrementation. |
|
|
|
|