This file provides Euler tour iterators and a function to check if a (di)graph is Eulerian.
#include <lemon/core.h>
#include <lemon/adaptors.h>
#include <lemon/connectivity.h>
#include <list>
Classes | |
class | DiEulerIt< GR > |
Euler tour iterator for digraphs. More... | |
class | EulerIt< GR > |
Euler tour iterator for graphs. More... | |
Namespaces | |
namespace | lemon |
The namespace of LEMON. | |
Functions | |
template<typename GR > | |
bool | eulerian (const GR &g) |
Check if the given graph is Eulerian. |