-
Notifications
You must be signed in to change notification settings - Fork 80
/
Copy pathEdgeListTests.swift
120 lines (106 loc) · 4.25 KB
/
EdgeListTests.swift
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
//
// UnionTests.swift
// SwiftGraph
//
// Copyright (c) 2019 Ferran Pujol Camins
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
import XCTest
import SwiftGraph
class EdgeListTests: XCTestCase {
func testSingleDirectedEdgeList() {
let g = UnweightedGraph(vertices: ["A", "B"])
g.addEdge(from: "A", to: "B", directed: true)
XCTAssertEqual(g.edgeList(), [UnweightedEdge(u: 0, v: 1, directed: true)])
}
func testSingleDirectedLoopList() {
let g = UnweightedGraph(vertices: ["A"])
g.addEdge(from: "A", to: "A", directed: true)
XCTAssertEqual(g.edgeList(), [UnweightedEdge(u: 0, v: 0, directed: true)])
}
func testSingleUndirectedEdgeList() {
let g = UnweightedGraph(vertices: ["A", "B"])
g.addEdge(from: "A", to: "B", directed: false)
XCTAssertEqual(g.edgeList(), [UnweightedEdge(u: 0, v: 1, directed: false)])
}
func testSingleUndirectedLoopList() {
let g = UnweightedGraph(vertices: ["A"])
g.addEdge(from: "A", to: "A", directed: false)
XCTAssertEqual(g.edgeList(), [UnweightedEdge(u: 0, v: 0, directed: false)])
}
func testDirectedAndUndirectedEdges() {
let g = UnweightedGraph(vertices: ["A", "B"])
g.addEdge(from: "A", to: "B", directed: true)
g.addEdge(from: "A", to: "B", directed: false)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 1, directed: true),
UnweightedEdge(u: 0, v: 1, directed: false)
])
}
func testDirectedAndUndirectedLoops() {
let g = UnweightedGraph(vertices: ["A"])
g.addEdge(from: "A", to: "A", directed: true)
g.addEdge(from: "A", to: "A", directed: false)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 0, directed: true),
UnweightedEdge(u: 0, v: 0, directed: false)
])
}
func testTwoDirectedEdges() {
let g = UnweightedGraph(vertices: ["A", "B"])
g.addEdge(from: "A", to: "B", directed: true)
g.addEdge(from: "A", to: "B", directed: true)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 1, directed: true),
UnweightedEdge(u: 0, v: 1, directed: true)
])
let g2 = UnweightedGraph(vertices: ["A", "B"])
g2.addEdge(from: "A", to: "B", directed: true)
g2.addEdge(from: "B", to: "A", directed: true)
XCTAssertEqual(g2.edgeList(), [
UnweightedEdge(u: 0, v: 1, directed: true),
UnweightedEdge(u: 1, v: 0, directed: true)
])
}
func testTwoDirectedLoops() {
let g = UnweightedGraph(vertices: ["A"])
g.addEdge(from: "A", to: "A", directed: true)
g.addEdge(from: "A", to: "A", directed: true)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 0, directed: true),
UnweightedEdge(u: 0, v: 0, directed: true)
])
}
func testTwoUndirectedEdges() {
let g = UnweightedGraph(vertices: ["A", "B"])
g.addEdge(from: "A", to: "B", directed: false)
g.addEdge(from: "A", to: "B", directed: false)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 1, directed: false),
UnweightedEdge(u: 0, v: 1, directed: false)
])
}
func testTwoUndirectedLoops() {
let g = UnweightedGraph(vertices: ["A"])
g.addEdge(from: "A", to: "A", directed: false)
g.addEdge(from: "A", to: "A", directed: false)
XCTAssertEqual(g.edgeList(), [
UnweightedEdge(u: 0, v: 0, directed: false),
UnweightedEdge(u: 0, v: 0, directed: false)
])
}
func testCompleteGraph() {
let g = CompleteGraph.build(withVertices: ["A", "B", "C", "D"])
XCTAssertEqual(g.edgeList().count, 6)
}
}