dsalgo 0.3.10

A package for Datastructures and 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

use crate::{
    argmax::argmax,
    tree_bfs_parent_depth::bfs,
};

pub fn diameter_path(g: &[Vec<usize>]) -> Vec<usize> {
    let (_, dep) = bfs(&g, 0);

    let (parent, dep) = bfs(&g, argmax(&dep));

    let mut v = argmax(&dep);

    let mut path = vec![v];

    for _ in 0..dep[v] {
        v = parent[v];

        path.push(v);
    }

    path
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let cases = vec![(
            vec![
                vec![1],
                vec![0, 2],
                vec![1, 3, 4],
                vec![2],
                vec![2, 5],
                vec![4],
            ],
            vec![0, 1, 2, 4, 5],
        )];

        for (g, ans) in cases {
            assert_eq!(diameter_path(&g), ans);
        }
    }
}