-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtdd_tests
133 lines (112 loc) · 3.01 KB
/
tdd_tests
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
#include "tdd_code.h"
Graph::Graph() {}
Graph::~Graph() { clear(); }
std::vector<Node *> Graph::nodes() { return array_of_nodes; }
std::vector<Edge> Graph::edges() const { return array_of_edges; }
Node *Graph::addNode(size_t nodeId) {
if (getNode(nodeId) == nullptr) {
Node *node = new Node(nodeId);
array_of_nodes.push_back(node);
return node;
} else {
return nullptr;
}
}
bool Graph::addEdge(const Edge &edge) {
if (edge.a == edge.b)
return false;
if (containsEdge(edge))
return false;
addNode(edge.a);
addNode(edge.b);
array_of_edges.push_back(edge);
return true;
}
void Graph::addMultipleEdges(const std::vector<Edge> &edges) {
for (auto i = 0; i < edges.size(); i++) {
addEdge(edges.at(i));
}
}
Node *Graph::getNode(size_t nodeId) {
for (auto i = 0; i < array_of_nodes.size(); i++) {
if (array_of_nodes[i]->id == nodeId) {
return array_of_nodes[i];
}
}
return nullptr;
}
bool Graph::containsEdge(const Edge &edge) const {
for (auto i = 0; i < array_of_edges.size(); i++) {
if (array_of_edges[i] == edge)
return true;
}
return false;
}
void Graph::removeNode(size_t nodeId) {
for (auto i = 0; i < array_of_nodes.size(); i++) {
if (array_of_nodes[i]->id == nodeId) {
for (auto j = 0; j < array_of_edges.size(); j++) {
if (array_of_edges[j].a == array_of_nodes[i]->id) {
removeEdge(array_of_edges[j]);
j--;
} else if (array_of_edges[j].b == array_of_nodes[i]->id) {
removeEdge(array_of_edges[j]);
j--;
}
}
free(array_of_nodes[i]);
array_of_nodes.erase(array_of_nodes.begin() + i);
return;
}
}
throw std::out_of_range("out_of_range");
}
void Graph::removeEdge(const Edge &edge) {
for (int i = 0; i < array_of_edges.size(); i++) {
if (array_of_edges[i] == edge) {
array_of_edges.erase(array_of_edges.begin() + i);
return;
}
}
throw std::out_of_range("out_of_range");
}
size_t Graph::nodeCount() const { return array_of_nodes.size(); }
size_t Graph::edgeCount() const { return array_of_edges.size(); }
size_t Graph::nodeDegree(size_t nodeId) const {
int edge = 0;
for (auto i = 0; i < array_of_nodes.size(); i++) {
if (array_of_nodes[i]->id == nodeId) {
for (auto i = 0; i < array_of_edges.size(); i++) {
if (array_of_edges[i].a == nodeId) {
edge++;
} else if (array_of_edges[i].b == nodeId) {
edge++;
}
}
}
}
if (edge > 0) {
return edge;
} else {
throw std::out_of_range("out_of_range");
}
}
size_t Graph::graphDegree() const {
size_t x = 0;
for (auto i = 0; i < array_of_nodes.size(); i++) {
auto Id = array_of_nodes[i]->id;
if (nodeDegree(Id) > x) {
x = nodeDegree(Id);
}
}
return x;
}
void Graph::coloring() {}
void Graph::clear() {
// for (auto i = 0; i < array_of_edges.size(); i++) {
// removeEdge(array_of_edges[i]);
// }
for (auto j = 0; j < array_of_nodes.size();) {
removeNode(array_of_nodes[j]->id);
}
}