-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.test.js
284 lines (261 loc) · 5.89 KB
/
index.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
const { test } = require("node:test");
const assert = require("node:assert");
const tarjan = require("./index.js");
test("empty graph", () => {
const graph = new Map();
const result = tarjan(graph);
assert.deepStrictEqual(result, []);
});
test("single node graph", () => {
const graph = new Map([["A", []]]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A"])]);
});
test("two disconnected nodes", () => {
const graph = new Map([
["A", []],
["B", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A"]), new Set(["B"])]);
});
test("single node self-loop", () => {
const graph = new Map([["A", ["A"]]]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A"])]);
});
test("simple cycle", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["A"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B", "C"])]);
});
test("linear chain", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["C"]),
new Set(["B"]),
new Set(["A"]),
]);
});
test("graph with nested cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["A", "D"]],
["D", ["E"]],
["E", ["D"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["D", "E"]),
new Set(["A", "B", "C"]),
]);
});
test("disconnected graph with cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", ["A"]],
["C", ["D"]],
["D", ["C"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B"]), new Set(["C", "D"])]);
});
test("single edge cycle", () => {
const graph = new Map([
["A", ["B"]],
["B", ["A"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B"])]);
});
test("graph with isolated nodes", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["A"]],
["D", []],
["E", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["A", "B", "C"]),
new Set(["D"]),
new Set(["E"]),
]);
});
test("dense graph with one SCC", () => {
const graph = new Map([
["A", ["B", "C", "D"]],
["B", ["C", "D", "A"]],
["C", ["D", "A", "B"]],
["D", ["A", "B", "C"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B", "C", "D"])]);
});
test("sparse graph", () => {
const graph = new Map([
["A", ["B"]],
["B", []],
["C", ["D"]],
["D", []],
["E", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["B"]),
new Set(["A"]),
new Set(["D"]),
new Set(["C"]),
new Set(["E"]),
]);
});
test("large chain with cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["D"]],
["D", ["E"]],
["E", ["C"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["C", "D", "E"]),
new Set(["B"]),
new Set(["A"]),
]);
});
test("chain ending in a self-loop", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["C"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["C"]),
new Set(["B"]),
new Set(["A"]),
]);
});
test("graph with multiple independent cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", ["A"]],
["C", ["D"]],
["D", ["C"]],
["E", ["F"]],
["F", ["G"]],
["G", ["E"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["A", "B"]),
new Set(["C", "D"]),
new Set(["E", "F", "G"]),
]);
});
test("complex graph with no cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", []],
["D", ["E"]],
["E", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["C"]),
new Set(["B"]),
new Set(["A"]),
new Set(["E"]),
new Set(["D"]),
]);
});
test("complex graph with cycles and chains", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["A", "D"]],
["D", ["E"]],
["E", ["F"]],
["F", ["D", "G"]],
["G", []],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["G"]),
new Set(["D", "E", "F"]),
new Set(["A", "B", "C"]),
]);
});
test("graph with set iterators", () => {
const graph = new Map([
["A", new Set(["B", "C"])],
["B", new Set(["C"])],
["C", new Set()],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["C"]),
new Set(["B"]),
new Set(["A"]),
]);
});
test("mixed iterator types", () => {
const graph = new Map([
["A", ["B", "C"]],
["B", new Set(["C", "D"])],
["C", ["D"]],
["D", new Set()],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["D"]),
new Set(["C"]),
new Set(["B"]),
new Set(["A"]),
]);
});
test("graph with arrays forming a cycle", () => {
const graph = new Map([
["A", ["B"]],
["B", ["C"]],
["C", ["A"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B", "C"])]);
});
test("graph with sets forming a cycle", () => {
const graph = new Map([
["A", new Set(["B"])],
["B", new Set(["C"])],
["C", new Set(["A"])],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [new Set(["A", "B", "C"])]);
});
test("mixed iterators forming nested cycles", () => {
const graph = new Map([
["A", ["B"]],
["B", new Set(["C"])],
["C", ["A", "D"]],
["D", new Set(["E"])],
["E", ["D"]],
]);
const result = tarjan(graph);
assert.deepStrictEqual(result, [
new Set(["D", "E"]),
new Set(["A", "B", "C"]),
]);
});