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
29
30
31
32
33
34

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

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

    #[test]
    fn test_dfs_disconnected() {
        let mut graph = HashMap::new();
        graph.insert(1, vec![2]);
        graph.insert(2, vec![]);
        graph.insert(3, vec![]);
        let order = dfs(&graph, 1);
        assert_eq!(order, vec![1, 2]);
    }

    #[test]
    fn test_dfs_single_node() {
        let mut graph = HashMap::new();
        graph.insert(1, vec![]);
        let order = dfs(&graph, 1);
        assert_eq!(order, vec![1]);
    }
}