A collection of algorithms for cycles in a graph.
Project description
cycless
A collection of algorithms to analyze a graph as a set of cycles.
Some codes come from https://github.com/vitroid/Polyhed and https://github.com/vitroid/countrings are integrated and improved.
References
- M. Matsumoto, A. Baba, and I. Ohmine, Topological building blocks of hydrogen bond network in water, J. Chem. Phys. 127, 134504 (2007). http://doi.org/10.1063/1.2772627
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
cycless-0.1.2.tar.gz
(6.6 kB
view hashes)
Built Distributions
cycless-0.1.2-py3.7.egg
(16.2 kB
view hashes)
Close
Hashes for cycless-0.1.2-py2.py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 71ac22c0ed01092d9157372181a7dbaf2dac7e3d2ae283685ab47f159f9b1219 |
|
| MD5 | e6ad3ed9a63622fe2154ec0af73cb3de |
|
| BLAKE2b-256 | 1d7378bdbfdbdad1f6c2f7d0c89cf946445260784d695c40a8dc8e85ddf2cac0 |
