petgraph 0.8.3

Graph data structure library. Provides graph types and graph algorithms.
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
29
30
31
32
33
34
35

#![feature(test)]

extern crate petgraph;
extern crate test;

use core::cmp::{max, min};
use petgraph::prelude::*;
use test::Bencher;

use petgraph::algo::spfa;

#[bench]
fn spfa_bench(bench: &mut Bencher) {
    static NODE_COUNT: usize = 100;
    let mut g = Graph::new();
    let nodes: Vec<NodeIndex<_>> = (0..NODE_COUNT).map(|i| g.add_node(i)).collect();
    for i in 0..NODE_COUNT {
        let n1 = nodes[i];
        let neighbour_count = i % 8 + 3;
        let j_from = max(0, i as i32 - neighbour_count as i32 / 2) as usize;
        let j_to = min(NODE_COUNT, j_from + neighbour_count);
        for j in j_from..j_to {
            let n2 = nodes[j];
            let mut distance: f64 = ((i + 3) % 10) as f64;
            if n1 != n2 {
                distance -= 0.5
            }
            g.add_edge(n1, n2, distance);
        }
    }

    bench.iter(|| {
        let _scores = spfa(&g, nodes[0], |edge| *edge.weight());
    });
}