Getting Started
User Guide
API Reference
Project
Defined in File EulerianCycle.h
whether the nodes c, the first repeated at the end, are a closed path that uses each edge of g exactly once; empty if g has no edge