#graph #path-finding #dijkstra #bellman-ford #easy-to-use

simple_graph_algorithms

A library with the goal of making running graph algorithms as easy as possible

1 stable release

1.0.0 Jun 19, 2023

#2347 in Algorithms

MIT license

70KB
896 lines

simple_graph_algorithms

This library aims to provide simple to use implementations for various algorithms run on graphs.

Algorithms

The following algorithms are currently implemented in this library:

Documentation

The documentation will be hosted on docs.rs once the first version has been released to crates.io.

Performance

Algorithm Mean time over 100 runs on a graph with 10,000 nodes and 39,600 edges
Bellman-Ford 2.1883 s
Dijkstra 52.3155 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.

Dependencies

~160KB