Unverified Commit 0691b60b authored by Felix's avatar Felix Committed by GitHub
Browse files

Update README.md

parent c76ce7d3
# cycle-coalescence-algorithm
## Introduction
Hello everyone,
I wrote this package during my PhD, when working on the characterization of transport networks.
Have you ever wondered how cycles in graphs form a vector space and encapsulate nesting information? If so, were you never really sure how to deal with this? Here is a tool ready to use, enabling you to calculate the cycle bases, mapping them onto a merging tree, and analyze this tree's asymmetry.
This project is based on the algorithm published in 'Extracting Hidden Hierarchies in 3D Distribution Networks' by Modes et al, 2016. Please acknowlede if used for any further publication.
./notebook contains examples to play with in the form of jupyter notebooks
## Installation
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment