pofk_algorithm 0.0.3

A collection of efficient algorithms implemented in Rust for real-world projects.
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

#[cfg(test)]
mod tests {
    use std::collections::HashMap;
    use crate::graph_algorithms::dijkstra::dijkstra;

    #[test]
    fn test_dijkstra_basic() {
        let mut graph = HashMap::new();
        graph.insert(1, vec![(2, 1), (3, 4)]);
        graph.insert(2, vec![(3, 2), (4, 5)]);
        graph.insert(3, vec![(4, 1)]);
        graph.insert(4, vec![]);
        let dist = dijkstra(&graph, 1);
        assert_eq!(dist[&4], 4);
        assert_eq!(dist[&3], 3);
    }

    #[test]
    fn test_dijkstra_disconnected() {
        let mut graph = HashMap::new();
        graph.insert(1, vec![(2, 1)]);
        graph.insert(2, vec![]);
        graph.insert(3, vec![]);
        let dist = dijkstra(&graph, 1);
        assert_eq!(dist[&2], 1);
        assert!(!dist.contains_key(&3));
    }
}