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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162

#![feature(test)]

extern crate petgraph;
extern crate test;

#[allow(dead_code)]
mod common;

use common::*;
use petgraph::algo::{bidirectional_dijkstra, dijkstra};
use petgraph::prelude::*;
use test::Bencher;

const RANDOM_GRAPH_SIZE: usize = 10_000;
const RANDOM_GRAPH_START: usize = 1;
const RANDOM_GRAPH_GOAL: usize = 9_000;

#[bench]
fn dijkstra_bench_random(bench: &mut Bencher) {
    let g = build_graph(RANDOM_GRAPH_SIZE, false);

    bench.iter(|| {
        let _scores = dijkstra(&g, NodeIndex::new(RANDOM_GRAPH_START), None, |e| {
            *e.weight()
        });
    });
}

#[bench]
fn dijkstra_bench_random_with_target(bench: &mut Bencher) {
    let g = build_graph(RANDOM_GRAPH_SIZE, false);

    bench.iter(|| {
        let _scores = dijkstra(
            &g,
            NodeIndex::new(RANDOM_GRAPH_START),
            Some(NodeIndex::new(RANDOM_GRAPH_GOAL)),
            |e| *e.weight(),
        );
    });
}

#[bench]
fn dijkstra_bench_random_bidirectional(bench: &mut Bencher) {
    let g = build_graph(RANDOM_GRAPH_SIZE, false);

    bench.iter(|| {
        let _result = bidirectional_dijkstra(
            &g,
            NodeIndex::new(RANDOM_GRAPH_START),
            NodeIndex::new(RANDOM_GRAPH_GOAL),
            |e| *e.weight(),
        );
    });
}

fn build_grid_graph(side: usize) -> Graph<(), usize, Undirected> {
    let mut graph = Graph::new_undirected();

    let mut node_indices = vec![vec![NodeIndex::end(); side]; side];

    for row in 0..side {
        for col in 0..side {
            let node = graph.add_node(());
            node_indices[row][col] = node;
        }
    }

    for row in 0..side {
        for col in 0..side {
            let node = node_indices[row][col];
            if row > 0 {
                graph.add_edge(node, node_indices[row - 1][col], 1);
            }
            if col > 0 {
                graph.add_edge(node, node_indices[row][col - 1], 1);
            }
        }
    }

    graph
}

const GRID_SIDE: usize = 100;
const GRID_START: usize = 50;
const GRID_GOAL: usize = 399;

#[bench]
fn dijkstra_bench_grid(bench: &mut Bencher) {
    let g = build_grid_graph(GRID_SIDE);

    bench.iter(|| {
        let _scores = dijkstra(&g, NodeIndex::new(GRID_START), None, |e| *e.weight());
    });
}

#[bench]
fn dijkstra_bench_grid_with_target(bench: &mut Bencher) {
    let g = build_grid_graph(GRID_SIDE);

    bench.iter(|| {
        let _scores = dijkstra(
            &g,
            NodeIndex::new(GRID_START),
            Some(NodeIndex::new(GRID_GOAL)),
            |e| *e.weight(),
        );
    });
}

#[bench]
fn dijkstra_bench_grid_bidirectional(bench: &mut Bencher) {
    let g = build_grid_graph(GRID_SIDE);

    bench.iter(|| {
        let _result = bidirectional_dijkstra(
            &g,
            NodeIndex::new(GRID_START),
            NodeIndex::new(GRID_GOAL),
            |e| *e.weight(),
        );
    });
}

#[bench]
fn dijkstra_2d_grid_line_bench(bench: &mut Bencher) {
    // Same line grid as ./astar.rs
    const N: usize = 500;
    const M: usize = 5;
    let g = common::build_2d_grid(N, M);

    let start_i = 0;
    let goal_i = N * M - 1;
    let start = NodeIndex::new(start_i);
    let goal = NodeIndex::new(goal_i);

    let costs = dijkstra(&g, start, None, |e| *e.weight());
    assert_eq!(costs[&goal], N + M - 2);

    bench.iter(|| {
        let _ = dijkstra(&g, start, None, |e| *e.weight());
    });
}

#[bench]
fn dijkstra_2d_grid_bench(bench: &mut Bencher) {
    // Same 2D grid as ./astar.rs
    const N: usize = 500;
    let g = common::build_2d_grid(N, N);

    let start_i = 0;
    let goal_i = N * N - 1;
    let start = NodeIndex::new(start_i);
    let goal = NodeIndex::new(goal_i);

    let costs = dijkstra(&g, start, None, |e| *e.weight());
    assert_eq!(costs[&goal], 2 * (N - 1));

    bench.iter(|| {
        let _ = dijkstra(&g, start, None, |e| *e.weight());
    });
}