ciclo 0.1.0

Exhaustive cycle enumeration.
Documentation
  • Coverage
  • 0%
    0 out of 9 items documented0 out of 0 items with examples
  • Size
  • Source code size: 21.38 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 2.59 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • Homepage
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • rapodaca

Ciclo: Exhaustive Cycle Enumeration

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.

Versions

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.

License and Copyright

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