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
pub fn dijkstra_dense(
inf: i64,
g: &[Vec<i64>],
src: usize,
) -> Vec<i64> {
let n = g.len();
let mut dist = vec![inf; n];
dist[src] = 0;
let mut visited = vec![false; n];
// loop {
for _ in 0..n - 1 {
let mut u = n;
let mut du = inf;
for i in 0..n {
if visited[i] || dist[i] >= du {
continue;
}
u = i;
du = dist[i];
}
if u == n {
break;
}
visited[u] = true;
for v in 0..n {
if g[u][v] == inf {
continue;
}
dist[v] = dist[v].min(du + g[u][v]);
}
}
dist
}
#[cfg(test)]
mod tests {
#[test]
fn test() {}
}