-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathtest.js
More file actions
134 lines (118 loc) · 3.56 KB
/
test.js
File metadata and controls
134 lines (118 loc) · 3.56 KB
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
const UndirectedGraph = require("./index");
const adjacencyList = Object.keys(new UndirectedGraph())[0];
function constructDefaultGraph() {
const graph = new UndirectedGraph();
graph.addVertex("A");
graph.addVertex("B");
graph.addVertex("C");
graph.addVertex("D");
graph.addVertex("E");
graph.addVertex("F");
graph.addEdge("A", "B");
graph.addEdge("A", "C");
graph.addEdge("B", "D");
graph.addEdge("C", "E");
graph.addEdge("D", "E");
graph.addEdge("D", "F");
graph.addEdge("E", "F");
// A
// / \
// B C
// | |
// D --- E
// \ /
// F
return graph;
}
describe("Graph Setup", () => {
test("set up property for adjacency list", () => {
const graph = new UndirectedGraph();
expect(typeof graph[adjacencyList]).toEqual("object");
});
});
describe.skip("addVertex", () => {
test("works and does not overwrite if vertex already exists", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
expect(graph[adjacencyList]["Tokyo"]).toEqual([]);
graph[adjacencyList]["Tokyo"].push("yo");
graph.addVertex("Tokyo");
expect(graph[adjacencyList]["Tokyo"]).toEqual(["yo"]);
});
});
describe.skip("addEdge", () => {
test("works", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
graph.addVertex("San Francisco");
graph.addEdge("Tokyo", "San Francisco");
expect(graph[adjacencyList]["Tokyo"]).toEqual(["San Francisco"]);
expect(graph[adjacencyList]["San Francisco"]).toEqual(["Tokyo"]);
});
test("checks for valid vertices", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
graph.addVertex("San Francisco");
graph.addEdge("Tokyo", "San Francisco");
graph.addEdge("sdasdasdas", "San Francisco");
graph.addEdge("Tokyo", "reytjdy");
expect(graph[adjacencyList]["Tokyo"]).toEqual(["San Francisco"]);
});
});
describe.skip("removeEdge", () => {
test("works", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
graph.addVertex("San Francisco");
graph.addEdge("Tokyo", "San Francisco");
graph.removeEdge("Tokyo", "San Francisco");
expect(graph[adjacencyList]["Tokyo"]).toEqual([]);
expect(graph[adjacencyList]["San Francisco"]).toEqual([]);
});
test("checks for valid vertices", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
graph.addVertex("San Francisco");
graph.removeEdge("Tokyooo", "San Francisco");
graph.removeEdge("Tokyo", "San Franciscooo");
});
});
describe.skip("removeVertex", () => {
test("removes vertex from adjacency list and as a neighbor vertex for other vertices.", () => {
const graph = new UndirectedGraph();
graph.addVertex("Tokyo");
graph.addVertex("San Francisco");
graph.addEdge("Tokyo", "San Francisco");
graph.removeVertex("Tokyo");
expect(graph[adjacencyList]["San Francisco"]).toEqual([]);
expect(graph[adjacencyList]["Tokyo"]).toBeFalsy();
});
test("checks for valid vertices.", () => {
const graph = new UndirectedGraph();
graph.removeVertex("Tokyooo");
});
});
describe.skip("dfs", () => {
const possibleResults = ["ABDECF", "ACEFDB"];
test("works.", () => {
expect(
possibleResults.includes(
constructDefaultGraph()
.dfs("A")
.join("")
)
).toEqual(true);
});
});
describe.skip("bfs", () => {
test("works.", () => {
expect(constructDefaultGraph().bfs("A")).toEqual([
"A",
"B",
"C",
"D",
"E",
"F"
]);
});
});