-
Notifications
You must be signed in to change notification settings - Fork 0
/
DijkstralList.ts
59 lines (48 loc) · 1.48 KB
/
DijkstralList.ts
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
import dijkstra_list from "@code/DijkstraList";
function hasUnvisted(seen: boolean[],dists: number[] ): boolean{
return seen.some((s, i) => !s && dists[i] < Infinity)
}
function getLowestUnvisted(seen: boolean[],dists: number[] ): number{
let idx = -1;
let lowestDistance = Infinity;
for(let i = 0; i < seen.length; ++i){
if(seen [i]){
continue;
}
if(lowestDistance > dists[i]){
lowestDistance = dists[i];
idx = i;
}
}
return idx;
}
export default function dijkstra_list( source: number, sink: number, arr: WeightedAdjacencyList): number[]{
const seen = new Array(arr.length).fill(false);
const prev = new Array(arr.length).fill(-1);
const dists = new Array(arr.length).fill(Infinity);
dists[source] = 0;
while(hasUnvisted(seen, dists)){
const curr = getLowestUnvisted(seen, dists);
seen[curr] = true;
const adjs = arr[curr];
for (let i = 0; i < adjs.length; ++i){
const edge = adjs[i];
if(seen[edge.to]){
continue
}
const dist = dists[curr] + edge.weight;
if(dist < dists[edge.to]){
dists[edge.to] = dist;
prev[edge.to] = curr
}
}
}
const out: number[] = [];
let curr = sink;
while(prev[curr] !== -1){
out.push(curr);
curr = prev[curr];
}
out.push(source)
return out.reverse();
}