Enumerating k-connected orientations
Project description
Enumerating k-connected orientations
This project presents an enumeration algorithm for the k-connected orientations of a given multi-graph.
License
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
orientations-0.3.0.tar.gz
(14.8 kB
view hashes)
Built Distribution
Close
Hashes for orientations-0.3.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c98e2d012b2c3f969d43c9e4544df8a56aeee434bfecab2cdaee70e886b79aea |
|
MD5 | 402bdc0b808187d08606ba74adfe589f |
|
BLAKE2b-256 | a1cd407b7fb73b98d8c1edd0b2c06d6052ca0f6391e2158376a089873ace1ba6 |