converge-optimization 3.9.2

Optimization algorithms for converge.zone - Rust reimplementation of OR-Tools subset
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
36
37
38
39
40
41
42
43
44

//! Benchmarks for graph algorithms

use converge_optimization::graph::dijkstra;
use criterion::{BenchmarkId, Criterion, criterion_group, criterion_main};
use petgraph::graph::DiGraph;
use rand::rngs::StdRng;
use rand::{RngExt, SeedableRng};
use std::hint::black_box;

fn random_graph(nodes: usize, edges: usize, seed: u64) -> DiGraph<(), i64> {
    let mut rng = StdRng::seed_from_u64(seed);
    let mut graph = DiGraph::new();

    let node_indices: Vec<_> = (0..nodes).map(|_| graph.add_node(())).collect();

    for _ in 0..edges {
        let from = rng.random_range(0..nodes);
        let to = rng.random_range(0..nodes);
        if from != to {
            let cost = rng.random_range(1..100);
            graph.add_edge(node_indices[from], node_indices[to], cost);
        }
    }

    graph
}

fn bench_dijkstra(c: &mut Criterion) {
    let mut group = c.benchmark_group("dijkstra");

    for (nodes, edges) in [(100, 500), (500, 2500), (1000, 5000)].iter() {
        let graph = random_graph(*nodes, *edges, 42);
        let source = graph.node_indices().next().unwrap();

        group.bench_with_input(BenchmarkId::new("nodes", nodes), &graph, |b, g| {
            b.iter(|| dijkstra::dijkstra(black_box(g), source, |&w| w))
        });
    }

    group.finish();
}

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