simple_graph_algorithms
| Crates.io | simple_graph_algorithms |
| lib.rs | simple_graph_algorithms |
| version | 1.0.0 |
| created_at | 2023-06-19 21:54:05.756182+00 |
| updated_at | 2023-06-19 21:54:05.756182+00 |
| description | A library with the goal of making running graph algorithms as easy as possible. |
| homepage | |
| repository | https://github.com/LMH01/simple_graph_algorithms |
| max_upload_size | |
| id | 894419 |
| size | 71,158 |
Louis (LMH01)
documentation
README
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.