simple_graph_algorithms 1.0.0

A library with the goal of making running graph algorithms as easy as possible.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

# 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:

- **[Dijkstra's algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)**
- **[Bellman-Ford algorithm](https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm)**

## Documentation

The documentation will be hosted on [docs.rs](https://docs.rs) once the first version has been released to [crates.io](https://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.