-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.spec.js
97 lines (86 loc) · 2.44 KB
/
graph.spec.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
const test = require('tape');
const Graph = require('./graph');
test('Graph', (assert) => {
const g = new Graph();
assert.ok(g instanceof Graph, 'should create a new graph data structure');
assert.end();
});
test('Graph addNode', (assert) => {
const g = new Graph();
assert.doesNotThrow(() => g.addNode('A'), 'should not throw');
assert.end();
});
test('Graph contains', (assert) => {
const g = new Graph();
g.addNode('A');
assert.ok(g.contains('A'), 'should return true');
assert.notOk(g.contains('B'), 'should return false');
assert.end();
});
test('Graph removeNode', (assert) => {
const g = new Graph();
g.addNode('A');
assert.ok(g.contains('A'), 'should return true');
g.removeNode('A');
assert.notOk(g.contains('A'), 'should return false');
assert.end();
});
test('Graph getNode', (assert) => {
const g = new Graph();
g.addNode('A');
const a = g.getNode('A');
assert.ok(Object.keys(a.edges).length === 0, 'should have edges');
assert.end();
});
test('Graph addEdge', (assert) => {
const g = new Graph();
g.addNode('A');
g.addNode('B');
assert.doesNotThrow(() => g.addEdge('A', 'B'), 'should not throw');
assert.end();
});
test('Graph hasEdge', (assert) => {
const g = new Graph();
g.addNode('A');
g.addNode('B');
g.addNode('C');
g.addEdge('A', 'B');
assert.ok(g.hasEdge('A', 'B'), 'should return true');
assert.notOk(g.hasEdge('A', 'C'), 'should return false');
assert.end();
});
test('Graph removeEdge', (assert) => {
const g = new Graph();
g.addNode('A');
g.addNode('B');
g.addEdge('A', 'B');
assert.ok(g.hasEdge('A', 'B'), 'should return true');
g.removeEdge('A', 'B');
assert.notOk(g.hasEdge('A', 'B'), 'should return false');
assert.end();
});
test('Graph node add edge to itself', (assert) => {
const g = new Graph();
g.addNode('A');
assert.throws(() => g.addEdge('A', 'A'), 'should throw');
assert.end();
});
test('Graph node add cyclic edge from distance of one', (assert) => {
const g = new Graph();
g.addNode('A');
g.addNode('B');
g.addEdge('A', 'B');
assert.throws(() => g.addEdge('B', 'A'), 'should throw');
assert.end();
});
test('Graph node add cyclic edge from distance of two', (assert) => {
const g = new Graph();
g.addNode('A');
g.addNode('B');
g.addNode('C');
g.addEdge('A', 'B');
g.addEdge('B', 'C');
assert.throws(() => g.addEdge('C', 'A'), 'should throw');
assert.notOk(g.hasEdge('C', 'A'), 'should remove the edge');
assert.end();
});