Exhaustive cycle enumeration is a common requirement when working with graphs. Many algorithms have been published. A particularly simple and efficient variant is described in A New Algorithm for Exhaustive Ring Perception in a Molecular Graph. This crate implements that algorithm. For details, see the article.

Ciclo is not yet stable. Patch versions never introduce breaking changes, but minor/major versions probably will. For details about each versions changes, see the CHANGELOG.

Ciclo is distributed under the terms of the MIT License. see LICENSE and COPYRIGHT for details.