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