Skip to content

Commit 952a064

Browse files
committed
further corrections
1 parent 69b7eee commit 952a064

File tree

1 file changed

+45
-45
lines changed

1 file changed

+45
-45
lines changed

Depth-First Search/Tests/DepthFirstSearchTests.swift

Lines changed: 45 additions & 45 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ class DepthFirstSearchTests: XCTestCase {
99
#endif
1010
}
1111
func testExploringTree() {
12-
let tree = Graph()
12+
let tree = Digraph()
1313

1414
let nodeA = tree.addNode("a")
1515
let nodeB = tree.addNode("b")
@@ -33,58 +33,58 @@ class DepthFirstSearchTests: XCTestCase {
3333
XCTAssertEqual(nodesExplored, ["a", "b", "d", "e", "h", "c", "f", "g"])
3434
}
3535

36-
func testExploringGraph() {
37-
let graph = Graph()
36+
func testExploringDigraph() {
37+
let digraph = Digraph()
3838

39-
let nodeA = graph.addNode("a")
40-
let nodeB = graph.addNode("b")
41-
let nodeC = graph.addNode("c")
42-
let nodeD = graph.addNode("d")
43-
let nodeE = graph.addNode("e")
44-
let nodeF = graph.addNode("f")
45-
let nodeG = graph.addNode("g")
46-
let nodeH = graph.addNode("h")
47-
let nodeI = graph.addNode("i")
39+
let nodeA = digraph.addNode("a")
40+
let nodeB = digraph.addNode("b")
41+
let nodeC = digraph.addNode("c")
42+
let nodeD = digraph.addNode("d")
43+
let nodeE = digraph.addNode("e")
44+
let nodeF = digraph.addNode("f")
45+
let nodeG = digraph.addNode("g")
46+
let nodeH = digraph.addNode("h")
47+
let nodeI = digraph.addNode("i")
4848

49-
graph.addEdge(nodeA, neighbor: nodeB)
50-
graph.addEdge(nodeA, neighbor: nodeH)
51-
graph.addEdge(nodeB, neighbor: nodeA)
52-
graph.addEdge(nodeB, neighbor: nodeC)
53-
graph.addEdge(nodeB, neighbor: nodeH)
54-
graph.addEdge(nodeC, neighbor: nodeB)
55-
graph.addEdge(nodeC, neighbor: nodeD)
56-
graph.addEdge(nodeC, neighbor: nodeF)
57-
graph.addEdge(nodeC, neighbor: nodeI)
58-
graph.addEdge(nodeD, neighbor: nodeC)
59-
graph.addEdge(nodeD, neighbor: nodeE)
60-
graph.addEdge(nodeD, neighbor: nodeF)
61-
graph.addEdge(nodeE, neighbor: nodeD)
62-
graph.addEdge(nodeE, neighbor: nodeF)
63-
graph.addEdge(nodeF, neighbor: nodeC)
64-
graph.addEdge(nodeF, neighbor: nodeD)
65-
graph.addEdge(nodeF, neighbor: nodeE)
66-
graph.addEdge(nodeF, neighbor: nodeG)
67-
graph.addEdge(nodeG, neighbor: nodeF)
68-
graph.addEdge(nodeG, neighbor: nodeH)
69-
graph.addEdge(nodeG, neighbor: nodeI)
70-
graph.addEdge(nodeH, neighbor: nodeA)
71-
graph.addEdge(nodeH, neighbor: nodeB)
72-
graph.addEdge(nodeH, neighbor: nodeG)
73-
graph.addEdge(nodeH, neighbor: nodeI)
74-
graph.addEdge(nodeI, neighbor: nodeC)
75-
graph.addEdge(nodeI, neighbor: nodeG)
76-
graph.addEdge(nodeI, neighbor: nodeH)
49+
digraph.addEdge(nodeA, neighbor: nodeB)
50+
digraph.addEdge(nodeA, neighbor: nodeH)
51+
digraph.addEdge(nodeB, neighbor: nodeA)
52+
digraph.addEdge(nodeB, neighbor: nodeC)
53+
digraph.addEdge(nodeB, neighbor: nodeH)
54+
digraph.addEdge(nodeC, neighbor: nodeB)
55+
digraph.addEdge(nodeC, neighbor: nodeD)
56+
digraph.addEdge(nodeC, neighbor: nodeF)
57+
digraph.addEdge(nodeC, neighbor: nodeI)
58+
digraph.addEdge(nodeD, neighbor: nodeC)
59+
digraph.addEdge(nodeD, neighbor: nodeE)
60+
digraph.addEdge(nodeD, neighbor: nodeF)
61+
digraph.addEdge(nodeE, neighbor: nodeD)
62+
digraph.addEdge(nodeE, neighbor: nodeF)
63+
digraph.addEdge(nodeF, neighbor: nodeC)
64+
digraph.addEdge(nodeF, neighbor: nodeD)
65+
digraph.addEdge(nodeF, neighbor: nodeE)
66+
digraph.addEdge(nodeF, neighbor: nodeG)
67+
digraph.addEdge(nodeG, neighbor: nodeF)
68+
digraph.addEdge(nodeG, neighbor: nodeH)
69+
digraph.addEdge(nodeG, neighbor: nodeI)
70+
digraph.addEdge(nodeH, neighbor: nodeA)
71+
digraph.addEdge(nodeH, neighbor: nodeB)
72+
digraph.addEdge(nodeH, neighbor: nodeG)
73+
digraph.addEdge(nodeH, neighbor: nodeI)
74+
digraph.addEdge(nodeI, neighbor: nodeC)
75+
digraph.addEdge(nodeI, neighbor: nodeG)
76+
digraph.addEdge(nodeI, neighbor: nodeH)
7777

78-
let nodesExplored = depthFirstSearch(graph, source: nodeA)
78+
let nodesExplored = depthFirstSearch(digraph, source: nodeA)
7979

8080
XCTAssertEqual(nodesExplored, ["a", "b", "c", "d", "e", "f", "g", "h", "i"])
8181
}
8282

83-
func testExploringGraphWithASingleNode() {
84-
let graph = Graph()
85-
let node = graph.addNode("a")
83+
func testExploringDigraphWithASingleNode() {
84+
let digraph = Digraph()
85+
let node = digraph.addNode("a")
8686

87-
let nodesExplored = depthFirstSearch(graph, source: node)
87+
let nodesExplored = depthFirstSearch(digraph, source: node)
8888

8989
XCTAssertEqual(nodesExplored, ["a"])
9090
}

0 commit comments

Comments
 (0)