pathfinding 4.15.0

Pathfinding, flow, 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

use pathfinding::NodeRefs;
use pathfinding::prelude::{bfs, bfs_bidirectional};
use std::collections::{HashMap, HashSet};

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
struct N(String);

#[test]
fn test_bfs_multiple_starts() {
    let node_a = N("a".into());
    let node_b = N("b".into());
    let node_c = N("c".into());
    let node_d = N("d".into());
    let node_e = N("e".into());

    let graph: HashMap<&N, HashSet<&N>> = HashMap::from_iter([
        (&node_a, HashSet::from([&node_b])),
        (&node_b, HashSet::from([&node_c])),
        (&node_c, HashSet::from([&node_d])),
        (&node_d, HashSet::from([&node_e])),
        (&node_e, HashSet::from([])),
    ]);

    // Single start and end.
    let path = bfs(
        &node_a,
        |n| graph.get(n).unwrap().clone().into_iter().cloned(),
        |n| n == &node_e,
    );
    assert_eq!(
        path,
        Some(
            [&node_a, &node_b, &node_c, &node_d, &node_e]
                .into_iter()
                .cloned()
                .collect()
        )
    );

    // Multiple start and end.
    let start = NodeRefs::from_iter([&node_a, &node_b]);
    let end = NodeRefs::from_iter([&node_d, &node_e]);
    let path = bfs(
        start,
        |n| graph.get(n).unwrap().clone().into_iter().cloned(),
        |n| end.contains(n),
    );
    assert_eq!(
        path,
        Some([&node_b, &node_c, &node_d].into_iter().cloned().collect())
    );
}

#[test]
fn test_bfs_bidirectional_multiple_starts() {
    let node_a = N("a".into());
    let node_b = N("b".into());
    let node_c = N("c".into());
    let node_d = N("d".into());
    let node_e = N("e".into());

    let graph: HashMap<&N, HashSet<&N>> = HashMap::from_iter([
        (&node_a, HashSet::from([&node_b])),
        (&node_b, HashSet::from([&node_c])),
        (&node_c, HashSet::from([&node_d])),
        (&node_d, HashSet::from([&node_e])),
        (&node_e, HashSet::from([])),
    ]);
    let reverse_graph: HashMap<&N, HashSet<&N>> = HashMap::from_iter([
        (&node_a, HashSet::from([])),
        (&node_b, HashSet::from([&node_a])),
        (&node_c, HashSet::from([&node_b])),
        (&node_d, HashSet::from([&node_c])),
        (&node_e, HashSet::from([&node_d])),
    ]);

    // Single start and end.
    let path = bfs_bidirectional(
        &node_a,
        &node_e,
        |n| graph.get(n).unwrap().clone().into_iter().cloned(),
        |n| reverse_graph.get(n).unwrap().clone().into_iter().cloned(),
    );
    assert_eq!(
        path,
        Some(
            [&node_a, &node_b, &node_c, &node_d, &node_e]
                .into_iter()
                .cloned()
                .collect()
        )
    );

    // Multiple start and end.
    let start = NodeRefs::from_iter([&node_a, &node_b]);
    let end = NodeRefs::from_iter([&node_d, &node_e]);
    let path = bfs_bidirectional(
        start,
        end,
        |n| graph.get(n).unwrap().clone().into_iter().cloned(),
        |n| reverse_graph.get(n).unwrap().clone().into_iter().cloned(),
    );
    assert_eq!(
        path,
        Some([&node_b, &node_c, &node_d].into_iter().cloned().collect())
    );
}