#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 in-degree is equal to the out-degree for all nodes), the following code will print the edge IDs according to an Euler tour of g
.
for(EulerIt<ListGraph> e(g),e!=INVALID;++e) { std::cout << g.id(e) << std::eol; }
g
is not Euler then the resulted tour will not be full or closed.
Public Member Functions | |
EulerIt (const Graph &_g, typename Graph::Node start=INVALID) | |
Constructor. | |
operator Edge () | |
Edge Conversion. | |
EulerIt & | operator++ () |
Next edge of the tour. | |
Edge | operator++ (int) |
Postfix incrementation. |
|
|
|
|