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

/// O(V^2)

pub fn dijkstra_dense(
    dense_graph: &[Vec<Option<u64>>],
    src: usize,
) -> Vec<Option<u64>> {
    let g = dense_graph;

    let n = g.len();

    let mut dist = vec![None; n];

    dist[src] = Some(0);

    let mut visited = vec![false; n];

    loop {
        let mut u = None;

        let mut du = None;

        for i in 0..n {
            if visited[i] || dist[i].is_none() {
                continue;
            }

            if du.is_none() || dist[i] < du {
                u = Some(i);

                du = dist[i];
            }
        }

        if u.is_none() {
            break;
        }

        let u = u.unwrap();

        let du = du.unwrap();

        visited[u] = true;

        for v in 0..n {
            if g[u][v].is_none() {
                continue;
            }

            let dv = Some(du + g[u][v].unwrap());

            if dist[v].is_none() || dv < dist[v] {
                dist[v] = dv;
            }
        }
    }

    dist
}

// TODO
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}