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

// TODO: refactor
use crate::negative_cycle::NegativeCycleError;

/// O(V^3)

pub(crate) fn bellman_ford_dense(
    g: &Vec<Vec<i64>>,
    src: usize,
) -> Result<Vec<i64>, NegativeCycleError> {
    let n = g.len();

    let inf = std::i64::MAX;

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

    dist[src] = 0;

    for _ in 0..n - 1 {
        for u in 0..n {
            for v in 0..n {
                if dist[u] == inf
                    || g[u][v] == inf
                    || dist[u] + g[u][v] >= dist[v]
                {
                    continue;
                }

                dist[v] = dist[u] + g[u][v];
            }
        }
    }

    for u in 0..n {
        for v in 0..n {
            if dist[u] == inf || g[u][v] == inf || dist[u] + g[u][v] >= dist[v]
            {
                continue;
            }

            return Err(NegativeCycleError::new());
        }
    }

    Ok(dist)
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}