@@ -9,7 +9,7 @@ class DepthFirstSearchTests: XCTestCase {
9
9
#endif
10
10
}
11
11
func testExploringTree( ) {
12
- let tree = Graph ( )
12
+ let tree = Digraph ( )
13
13
14
14
let nodeA = tree. addNode ( " a " )
15
15
let nodeB = tree. addNode ( " b " )
@@ -33,58 +33,58 @@ class DepthFirstSearchTests: XCTestCase {
33
33
XCTAssertEqual ( nodesExplored, [ " a " , " b " , " d " , " e " , " h " , " c " , " f " , " g " ] )
34
34
}
35
35
36
- func testExploringGraph ( ) {
37
- let graph = Graph ( )
36
+ func testExploringDigraph ( ) {
37
+ let digraph = Digraph ( )
38
38
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 " )
48
48
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)
77
77
78
- let nodesExplored = depthFirstSearch ( graph , source: nodeA)
78
+ let nodesExplored = depthFirstSearch ( digraph , source: nodeA)
79
79
80
80
XCTAssertEqual ( nodesExplored, [ " a " , " b " , " c " , " d " , " e " , " f " , " g " , " h " , " i " ] )
81
81
}
82
82
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 " )
86
86
87
- let nodesExplored = depthFirstSearch ( graph , source: node)
87
+ let nodesExplored = depthFirstSearch ( digraph , source: node)
88
88
89
89
XCTAssertEqual ( nodesExplored, [ " a " ] )
90
90
}
0 commit comments