-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.ts
55 lines (52 loc) · 1.07 KB
/
test.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
import * as graphs from "./DirectedGraphs";
var directedGraph = {
"nodes": [
{
"edge": [
{"nodeNr": 1,"weight": 7},
{"nodeNr": 2,"weight": 9},
{"nodeNr": 5,"weight": 14}
]
},
{
"edge": [
{"nodeNr": 0,"weight": 7},
{"nodeNr": 2,"weight": 10},
{"nodeNr": 3,"weight": 15}
]
},
{
"edge": [
{"nodeNr": 0,"weight": 9},
{"nodeNr": 1,"weight": 10},
{"nodeNr": 3,"weight": 11},
{"nodeNr": 5,"weight": 2}
]
},
{
"edge": [
{"nodeNr": 1,"weight": 15},
{"nodeNr": 2,"weight": 11},
{"nodeNr": 4,"weight": 6}
]
},
{
"edge": [
{"nodeNr": 3,"weight": 6},
{"nodeNr": 5,"weight": 9}
]
},
{
"edge": [
{"nodeNr": 0,"weight": 14},
{"nodeNr": 2,"weight": 2},
{"nodeNr": 4,"weight": 9}
]
}
]
};
var d = new graphs.NumberArrayReference();
var p = new graphs.NumberArrayReference();
var ds = new graphs.BooleanArrayReference();
graphs.DijkstrasAlgorithm(directedGraph, 0, d, ds, p);
console.log(d);