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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

use crate::connected_components_dsu::connected_components;

/// O(E\log{V})

pub fn mst_boruvka(
    v_size: usize,
    undirected_edges: &[(usize, usize, i64)],
) -> Vec<usize> {
    let m = undirected_edges.len();

    let mut is_added = vec![false; m];

    let mut added_eids = vec![];

    loop {
        let labels = connected_components(
            v_size,
            &added_eids
                .iter()
                .map(|&i| {
                    let e: (usize, usize, i64) = undirected_edges[i];

                    (e.0, e.1)
                })
                .collect::<Vec<_>>(),
        );

        let k = *labels.iter().max().unwrap() + 1;

        if k == 1 {
            break;
        }

        let mut min_edge = vec![m; k];

        for (i, &(u, v, w)) in undirected_edges.iter().enumerate() {
            if is_added[i] {
                continue;
            }

            let u = labels[u];

            let v = labels[v];

            if u == v {
                continue;
            }

            if min_edge[u] == m || w < undirected_edges[min_edge[u]].2 {
                min_edge[u] = i;
            }

            if min_edge[v] == m || w < undirected_edges[min_edge[v]].2 {
                min_edge[v] = i;
            }
        }

        for i in min_edge {
            if i == m || is_added[i] {
                continue;
            }

            added_eids.push(i);

            is_added[i] = true;
        }
    }

    added_eids
}

// TODO
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}