This library aims to provide simple to use implementations for various algorithms run on graphs.
The following algorithms are currently implemented in this library:
The documentation will be hosted on docs.rs once the first version has been released to crates.io.
| Algorithm | Mean time over 100 runs on a graph with 10,000 nodes and 39,600 edges |
|---|---|
| Bellman-Ford | 1.8786 s |
| Dijkstra | 52.874 ms |
These tests where performed on a Ryzen 5 7600x. Performance might be slower on older hardware.
To run these tests yourself type cargo bench, a full run will take a few minutes.