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

//! manage minimum weigted edges.

pub fn dense_graph_from_edges<T: Clone + Ord>(
    inf: T,
    n: usize,
    edges: Vec<(usize, usize, T)>,
) -> Vec<Vec<T>> {
    let mut g = vec![vec![inf; n]; n];

    for (u, v, w) in edges.into_iter() {
        let x = &mut g[u][v];

        if &w < x {
            *x = w;
        }
    }

    g
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

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

        for (edges, ans) in cases {
            assert_eq!(dense_graph_from_edges(inf, ans.len(), edges), ans);
        }
    }
}