further corrections

Author: JulioBBL

Depth-First Search/Tests/DepthFirstSearchTests.swift

@@ -9,7 +9,7 @@ class DepthFirstSearchTests: XCTestCase {
         #endif
     }
     func testExploringTree() {
-        let tree = Graph()
+        let tree = Digraph()
 
         let nodeA = tree.addNode("a")
         let nodeB = tree.addNode("b")
@@ -33,58 +33,58 @@ class DepthFirstSearchTests: XCTestCase {
         XCTAssertEqual(nodesExplored, ["a", "b", "d", "e", "h", "c", "f", "g"])
     }
 
-    func testExploringGraph() {
-        let graph = Graph()
+    func testExploringDigraph() {
+        let digraph = Digraph()
 
-        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")
-        let nodeH = graph.addNode("h")
-        let nodeI = graph.addNode("i")
+        let nodeA = digraph.addNode("a")
+        let nodeB = digraph.addNode("b")
+        let nodeC = digraph.addNode("c")
+        let nodeD = digraph.addNode("d")
+        let nodeE = digraph.addNode("e")
+        let nodeF = digraph.addNode("f")
+        let nodeG = digraph.addNode("g")
+        let nodeH = digraph.addNode("h")
+        let nodeI = digraph.addNode("i")
 
-        graph.addEdge(nodeA, neighbor: nodeB)
-        graph.addEdge(nodeA, neighbor: nodeH)
-        graph.addEdge(nodeB, neighbor: nodeA)
-        graph.addEdge(nodeB, neighbor: nodeC)
-        graph.addEdge(nodeB, neighbor: nodeH)
-        graph.addEdge(nodeC, neighbor: nodeB)
-        graph.addEdge(nodeC, neighbor: nodeD)
-        graph.addEdge(nodeC, neighbor: nodeF)
-        graph.addEdge(nodeC, neighbor: nodeI)
-        graph.addEdge(nodeD, neighbor: nodeC)
-        graph.addEdge(nodeD, neighbor: nodeE)
-        graph.addEdge(nodeD, neighbor: nodeF)
-        graph.addEdge(nodeE, neighbor: nodeD)
-        graph.addEdge(nodeE, neighbor: nodeF)
-        graph.addEdge(nodeF, neighbor: nodeC)
-        graph.addEdge(nodeF, neighbor: nodeD)
-        graph.addEdge(nodeF, neighbor: nodeE)
-        graph.addEdge(nodeF, neighbor: nodeG)
-        graph.addEdge(nodeG, neighbor: nodeF)
-        graph.addEdge(nodeG, neighbor: nodeH)
-        graph.addEdge(nodeG, neighbor: nodeI)
-        graph.addEdge(nodeH, neighbor: nodeA)
-        graph.addEdge(nodeH, neighbor: nodeB)
-        graph.addEdge(nodeH, neighbor: nodeG)
-        graph.addEdge(nodeH, neighbor: nodeI)
-        graph.addEdge(nodeI, neighbor: nodeC)
-        graph.addEdge(nodeI, neighbor: nodeG)
-        graph.addEdge(nodeI, neighbor: nodeH)
+        digraph.addEdge(nodeA, neighbor: nodeB)
+        digraph.addEdge(nodeA, neighbor: nodeH)
+        digraph.addEdge(nodeB, neighbor: nodeA)
+        digraph.addEdge(nodeB, neighbor: nodeC)
+        digraph.addEdge(nodeB, neighbor: nodeH)
+        digraph.addEdge(nodeC, neighbor: nodeB)
+        digraph.addEdge(nodeC, neighbor: nodeD)
+        digraph.addEdge(nodeC, neighbor: nodeF)
+        digraph.addEdge(nodeC, neighbor: nodeI)
+        digraph.addEdge(nodeD, neighbor: nodeC)
+        digraph.addEdge(nodeD, neighbor: nodeE)
+        digraph.addEdge(nodeD, neighbor: nodeF)
+        digraph.addEdge(nodeE, neighbor: nodeD)
+        digraph.addEdge(nodeE, neighbor: nodeF)
+        digraph.addEdge(nodeF, neighbor: nodeC)
+        digraph.addEdge(nodeF, neighbor: nodeD)
+        digraph.addEdge(nodeF, neighbor: nodeE)
+        digraph.addEdge(nodeF, neighbor: nodeG)
+        digraph.addEdge(nodeG, neighbor: nodeF)
+        digraph.addEdge(nodeG, neighbor: nodeH)
+        digraph.addEdge(nodeG, neighbor: nodeI)
+        digraph.addEdge(nodeH, neighbor: nodeA)
+        digraph.addEdge(nodeH, neighbor: nodeB)
+        digraph.addEdge(nodeH, neighbor: nodeG)
+        digraph.addEdge(nodeH, neighbor: nodeI)
+        digraph.addEdge(nodeI, neighbor: nodeC)
+        digraph.addEdge(nodeI, neighbor: nodeG)
+        digraph.addEdge(nodeI, neighbor: nodeH)
 
-        let nodesExplored = depthFirstSearch(graph, source: nodeA)
+        let nodesExplored = depthFirstSearch(digraph, source: nodeA)
 
         XCTAssertEqual(nodesExplored, ["a", "b", "c", "d", "e", "f", "g", "h", "i"])
     }
 
-    func testExploringGraphWithASingleNode() {
-        let graph = Graph()
-        let node = graph.addNode("a")
+    func testExploringDigraphWithASingleNode() {
+        let digraph = Digraph()
+        let node = digraph.addNode("a")
 
-        let nodesExplored = depthFirstSearch(graph, source: node)
+        let nodesExplored = depthFirstSearch(digraph, source: node)
 
         XCTAssertEqual(nodesExplored, ["a"])
     }