Analysis of ecological networks in Julia
Julia Makefile
Clone or download
tpoisot Merge pull request #106 from PoisotLab/develop
Bellman-Ford shortest path
Latest commit 2d7198a Jul 14, 2018
Failed to load latest commit information.
.github πŸ”§ update the documentation for types and conversions Jul 13, 2018
data πŸŽ‰ parametric types Jul 13, 2018
docs πŸŽ‰ add Bellman-Ford algorithm for shortest path Jul 14, 2018
test 🎨 replace @Assert with explicit error messages Jul 14, 2018
.gitignore πŸŽ‰ parametric types Jul 13, 2018
.zenodo.json Update .zenodo.json Jul 15, 2017 Create Jun 25, 2017 πŸ”§ CONTRIBUTING update Mar 10, 2017
Makefile πŸŽ‰ parametric types Jul 13, 2018 πŸ“š fix readme links Jul 6, 2017
test.jl πŸŽ‰ add Bellman-Ford algorithm for shortest path Jul 14, 2018


This julia package provides a common interface to analyze all types of data on ecological networks. It is designed to be general, easy to expand, and work on bipartite/unipartite as well as deterministic/quantitative/probabilistic networks. The development version is compatible with julia 0.6.

Join the chat at

You can read more about the selection of measures in:

Delmas, E. et al. Analyzing ecological networks of species interactions. bioRxiv 112540 (2017). doi:10.1101/112540

and about probabilistic networks in:

Poisot, T. et al. The structure of probabilistic networks. Methods in Ecology and Evolution 7, 303–312 (2016). doi: 10.1111/2041-210X.12468

Getting started

To get the stable version:


To stay up to date on more recent features, you may want to use the latest version -- it will always be stable:


How's the code doing?

Released version

DOI license

GitHub tag GitHub issues GitHub pull requests

EcologicalNetwork EcologicalNetwork EcologicalNetwork

On master

Build Status Coverage Status

On develop

Build Status Coverage Status