https://github.com/benmaier/effective-distance
provides a few functions to produce an effective distance tree from a given graph and root node
https://github.com/benmaier/effective-distance
Last synced: 2 months ago
JSON representation
provides a few functions to produce an effective distance tree from a given graph and root node
- Host: GitHub
- URL: https://github.com/benmaier/effective-distance
- Owner: benmaier
- Created: 2016-01-25T15:16:13.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2020-01-25T01:23:16.000Z (over 5 years ago)
- Last Synced: 2024-10-11T11:07:49.545Z (8 months ago)
- Language: Python
- Size: 3.91 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Effective Distance
Computes the effective distance between nodes in a weighted directed graph as declared in [1] or even the whole tree for a given root node. Subsequently the tree can be plotted with the (radial-distance-layout)[https://github.com/benmaier/radial-distance-layout] package.
[1] *The Hidden Geometry of Complex, Network-Driven Contagion Phenomena*, D Brockmann, D Helbing, Science Vol. 342, Issue 6164, pp. 1337-1342 (2013)
## Install
$ sudo python setup.py install
## Usage
```python
>>> import effdist
```