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

pub fn csgraph_from_dense<T: Eq>(
    inf: &T,
    g: Vec<Vec<T>>,
) -> Vec<(usize, usize, T)> {
    let mut cs = Vec::new();

    for (u, row) in g.into_iter().enumerate() {
        for (v, w) in row.into_iter().enumerate() {
            if &w == inf {
                continue;
            }

            cs.push((u, v, w));
        }
    }

    cs
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let inf = 1 << 30;

        let cases = vec![(
            vec![vec![0, 1, inf], vec![inf, 0, 2], vec![inf, 3, 0]],
            vec![
                (0, 0, 0),
                (0, 1, 1),
                (1, 1, 0),
                (1, 2, 2),
                (2, 1, 3),
                (2, 2, 0),
            ],
        )];

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