forked from TheAlgorithms/JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBellmanFord.test.js
51 lines (50 loc) · 936 Bytes
/
BellmanFord.test.js
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
import { BellmanFord } from '../BellmanFord.js'
test('Test Case 1', () => {
const V = 5
const E = 8
const destination = 3
const graph = [
[0, 1, -1],
[0, 2, 4],
[1, 2, 3],
[1, 3, 2],
[1, 4, 2],
[3, 2, 5],
[3, 1, 1],
[4, 3, -3]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(-2)
})
test('Test Case 2', () => {
const V = 6
const E = 9
const destination = 4
const graph = [
[0, 1, 3],
[0, 3, 6],
[0, 5, -1],
[1, 2, -3],
[1, 4, -2],
[5, 2, 5],
[2, 3, 1],
[4, 3, 5],
[5, 4, 2]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(1)
})
test('Test Case 3', () => {
const V = 4
const E = 5
const destination = 1
const graph = [
[0, 3, -1],
[0, 2, 4],
[3, 2, 2],
[3, 1, 5],
[2, 1, -1]
]
const dist = BellmanFord(graph, V, E, 0, destination)
expect(dist).toBe(0)
})