/
Graph.test.js
343 lines (289 loc) Β· 9.21 KB
/
Graph.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
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
// @flow strict-local
import assert from 'assert';
import sinon from 'sinon';
import Graph from '../src/Graph';
import {toNodeId} from '../src/types';
describe('Graph', () => {
it('constructor should initialize an empty graph', () => {
let graph = new Graph();
assert.deepEqual(graph.nodes, new Map());
assert.deepEqual([...graph.getAllEdges()], []);
});
it('addNode should add a node to the graph', () => {
let graph = new Graph();
let node = {};
let id = graph.addNode(node);
assert.equal(graph.nodes.get(id), node);
});
it('errors when traversing a graph with no root', () => {
let graph = new Graph();
assert.throws(() => {
graph.traverse(() => {});
}, /A start node is required to traverse/);
});
it("errors when traversing a graph with a startNode that doesn't belong", () => {
let graph = new Graph();
assert.throws(() => {
graph.traverse(() => {}, toNodeId(-1));
}, /Does not have node/);
});
it("errors if replaceNodeIdsConnectedTo is called with a node that doesn't belong", () => {
let graph = new Graph();
assert.throws(() => {
graph.replaceNodeIdsConnectedTo(toNodeId(-1), []);
}, /Does not have node/);
});
it("errors when adding an edge to a node that doesn't exist", () => {
let graph = new Graph();
let node = graph.addNode({});
assert.throws(() => {
graph.addEdge(node, toNodeId(-1));
}, /"to" node '-1' not found/);
});
it("errors when adding an edge from a node that doesn't exist", () => {
let graph = new Graph();
let node = graph.addNode({});
assert.throws(() => {
graph.addEdge(toNodeId(-1), node);
}, /"from" node '-1' not found/);
});
it('hasNode should return a boolean based on whether the node exists in the graph', () => {
let graph = new Graph();
let node = graph.addNode({});
assert(graph.hasNode(node));
assert(!graph.hasNode(toNodeId(-1)));
});
it('addEdge should add an edge to the graph', () => {
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
graph.addEdge(nodeA, nodeB);
assert(graph.hasEdge(nodeA, nodeB));
});
it('isOrphanedNode should return true or false if the node is orphaned or not', () => {
let graph = new Graph();
let rootNode = graph.addNode('root');
graph.setRootNodeId(rootNode);
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
graph.addEdge(rootNode, nodeB);
graph.addEdge(nodeB, nodeC, 1);
assert(graph.isOrphanedNode(nodeA));
assert(!graph.isOrphanedNode(nodeB));
assert(!graph.isOrphanedNode(nodeC));
});
it("removeEdge should throw if the edge doesn't exist", () => {
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
assert.throws(() => {
graph.removeEdge(nodeA, nodeB);
}, /Edge from 0 to 1 not found!/);
});
it('removeEdge should prune the graph at that edge', () => {
// a
// / \
// b - d
// /
// c
let graph = new Graph();
let nodeA = graph.addNode('a');
graph.setRootNodeId(nodeA);
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
let nodeD = graph.addNode('d');
graph.addEdge(nodeA, nodeB);
graph.addEdge(nodeA, nodeD);
graph.addEdge(nodeB, nodeC);
graph.addEdge(nodeB, nodeD);
graph.removeEdge(nodeA, nodeB);
assert(graph.nodes.has(nodeA));
assert(graph.nodes.has(nodeD));
assert(!graph.nodes.has(nodeB));
assert(!graph.nodes.has(nodeC));
assert.deepEqual(
[...graph.getAllEdges()],
[{from: nodeA, to: nodeD, type: 1}],
);
});
it('removing a node recursively deletes orphaned nodes', () => {
// before:
// a
// / \
// b c
// / \ \
// d e f
// /
// g
//
// after:
// a
// \
// c
// \
// f
let graph = new Graph();
let nodeA = graph.addNode('a');
graph.setRootNodeId(nodeA);
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
let nodeD = graph.addNode('d');
let nodeE = graph.addNode('e');
let nodeF = graph.addNode('f');
let nodeG = graph.addNode('g');
graph.addEdge(nodeA, nodeB);
graph.addEdge(nodeA, nodeC);
graph.addEdge(nodeB, nodeD);
graph.addEdge(nodeB, nodeE);
graph.addEdge(nodeC, nodeF);
graph.addEdge(nodeD, nodeG);
graph.removeNode(nodeB);
assert.deepEqual([...graph.nodes.keys()], [nodeA, nodeC, nodeF]);
assert.deepEqual(Array.from(graph.getAllEdges()), [
{from: nodeA, to: nodeC, type: 1},
{from: nodeC, to: nodeF, type: 1},
]);
});
it('removing a node recursively deletes orphaned nodes if there is no path to the root', () => {
// before:
// a
// / \
// b c
// / \ \
// |-d e f
// |/
// g
//
// after:
// a
// \
// c
// \
// f
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
let nodeD = graph.addNode('d');
let nodeE = graph.addNode('e');
let nodeF = graph.addNode('f');
let nodeG = graph.addNode('g');
graph.setRootNodeId(nodeA);
graph.addEdge(nodeA, nodeB);
graph.addEdge(nodeA, nodeC);
graph.addEdge(nodeB, nodeD);
graph.addEdge(nodeG, nodeD);
graph.addEdge(nodeB, nodeE);
graph.addEdge(nodeC, nodeF);
graph.addEdge(nodeD, nodeG);
graph.removeNode(nodeB);
assert.deepEqual([...graph.nodes.keys()], [nodeA, nodeC, nodeF]);
assert.deepEqual(Array.from(graph.getAllEdges()), [
{from: nodeA, to: nodeC, type: 1},
{from: nodeC, to: nodeF, type: 1},
]);
});
it('removing an edge to a node that cycles does not remove it if there is a path to the root', () => {
// a
// |
// b <----
// / \ |
// c d |
// \ / |
// e -----
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
let nodeD = graph.addNode('d');
let nodeE = graph.addNode('e');
graph.setRootNodeId(nodeA);
graph.addEdge(nodeA, nodeB);
graph.addEdge(nodeB, nodeC);
graph.addEdge(nodeB, nodeD);
graph.addEdge(nodeC, nodeE);
graph.addEdge(nodeD, nodeE);
graph.addEdge(nodeE, nodeB);
const getNodeIds = () => [...graph.nodes.keys()];
let nodesBefore = getNodeIds();
graph.removeEdge(nodeC, nodeE);
assert.deepEqual(nodesBefore, getNodeIds());
assert.deepEqual(Array.from(graph.getAllEdges()), [
{from: nodeA, to: nodeB, type: 1},
{from: nodeB, to: nodeC, type: 1},
{from: nodeB, to: nodeD, type: 1},
{from: nodeD, to: nodeE, type: 1},
{from: nodeE, to: nodeB, type: 1},
]);
});
it('removing a node with only one inbound edge does not cause it to be removed as an orphan', () => {
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
graph.setRootNodeId(nodeA);
graph.addEdge(nodeA, nodeB);
let spy = sinon.spy(graph, 'removeNode');
try {
graph.removeNode(nodeB);
assert(spy.calledOnceWithExactly(nodeB));
} finally {
spy.restore();
}
});
it("replaceNodeIdsConnectedTo should update a node's downstream nodes", () => {
let graph = new Graph();
let nodeA = graph.addNode('a');
graph.setRootNodeId(nodeA);
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
graph.addEdge(nodeA, nodeB);
graph.addEdge(nodeA, nodeC);
let nodeD = graph.addNode('d');
graph.replaceNodeIdsConnectedTo(nodeA, [nodeB, nodeD]);
assert(graph.hasNode(nodeA));
assert(graph.hasNode(nodeB));
assert(!graph.hasNode(nodeC));
assert(graph.hasNode(nodeD));
assert.deepEqual(Array.from(graph.getAllEdges()), [
{from: nodeA, to: nodeB, type: 1},
{from: nodeA, to: nodeD, type: 1},
]);
});
it('traverses along edge types if a filter is given', () => {
let graph = new Graph();
let nodeA = graph.addNode('a');
let nodeB = graph.addNode('b');
let nodeC = graph.addNode('c');
let nodeD = graph.addNode('d');
graph.addEdge(nodeA, nodeB, 2);
graph.addEdge(nodeA, nodeD);
graph.addEdge(nodeB, nodeC);
graph.addEdge(nodeB, nodeD, 2);
graph.setRootNodeId(nodeA);
let visited = [];
graph.traverse(
nodeId => {
visited.push(nodeId);
},
null, // use root as startNode
2,
);
assert.deepEqual(visited, [nodeA, nodeB, nodeD]);
});
it('correctly removes non-tree subgraphs', () => {
let graph = new Graph();
let nodeRoot = graph.addNode('root');
let node1 = graph.addNode('1');
let node2 = graph.addNode('2');
let node3 = graph.addNode('3');
graph.addEdge(nodeRoot, node1);
graph.addEdge(node1, node2);
graph.addEdge(node1, node3);
graph.addEdge(node2, node3);
graph.setRootNodeId(nodeRoot);
graph.removeNode(node1);
assert.strictEqual(graph.nodes.size, 1);
assert.deepStrictEqual(Array.from(graph.getAllEdges()), []);
});
});