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
26
27
28

use criterion::{black_box, criterion_group, criterion_main, Criterion};
use simple_graph_algorithms::{Graph, algorithms::{dijkstra, bellman_ford}};

fn criterion_benchmark(c: &mut Criterion) {
    let mut graph = graph();
    c.bench_function("dijkstra 100x100", |b| b.iter(|| {
        dijkstra(&mut graph, &String::from("[0|0]")).unwrap();
    }));
    c.bench_function("bellman-ford 100x100", |b| b.iter(|| {
        bellman_ford(&mut graph, &String::from("[0|0]")).unwrap();
    }));
}

criterion_group!(benches, criterion_benchmark);
criterion_main!(benches);

fn graph() -> Graph<String> {
    let mut vec = Vec::new();
    let node_weights = vec![7, 2, 4, 10, 5, 9, 3, 1, 6, 8];
    for i in 1..=100 {
        let mut inner_vec = Vec::new();
        for j in 1..=100 {
            inner_vec.push(node_weights[i*j%10]);
        }
        vec.push(inner_vec);
    }
    Graph::from(&vec)
}