-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph.cpp
294 lines (221 loc) · 6.32 KB
/
Graph.cpp
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
#include "Graph.h"
Graph::Graph(int n)
{
this->adjList.reserve(n);
this->Num_of_Vertices = n;
MakeEmptyGraph(n);
this->colors.reserve(n);
for (int i = 0; i < Num_of_Vertices; i++)
{
colors.push_back(WHITE);
}
this->colorsIsWhite = true;
this->edgesIsSorted = false;
}
/*********************************************************************/
Graph::~Graph() {
for (int i = 0; i < this->Num_of_Vertices; i++) {
delete adjList[i];
}
}
/*********************************************************************/
void Graph::MakeEmptyGraph(int n) {
for (int i = 0; i < n; i++) {
this->adjList.push_back(new List());
}
}
/*********************************************************************/
/*
* Checks if the edge (ver1, ver2) is in the graph.
*/
bool Graph::IsAdjacent(int ver1, int ver2) {
return adjList[ver1 - 1]->isInList(ver2 - 1);
}
/*********************************************************************/
/*
* GetAdjList returns a *duplication* of the adjList of vertex.
*/
List *Graph::GetAdjList(int vertex) {
List *result = adjList[vertex - 1]->duplicateList();
return result;
}
/*********************************************************************/
/*
* AddEdge Adds the edge (ver1, ver2) to the graph.
* In this function we get the vertices in terms of 1 - n
*
* ASSUMPTION: We will use Simple Graphs (no parallel edges).
*/
void Graph::AddEdge(int ver1, int ver2, int weight)
{
if (!IsAdjacent(ver1, ver2))
{
adjList[ver1 - 1]->insertToTail(ver2 - 1, weight);
weightedEdge e = { ver1 - 1, ver2 - 1, weight };
edges.push_back(e);
AddInvertedEdge(ver2, ver1, weight);
}
// else, the edge is already in the graph -> do nothing.
}
/*********************************************************************/
/*
* AddEdge Adds the edge (ver2, ver1) to the graph.
*/
void Graph::AddInvertedEdge(int ver2, int ver1, int weight)
{
if (!IsAdjacent(ver2, ver1))
{
adjList[ver2 - 1]->insertToTail(ver1 - 1, weight);
// no need to add to the vector, because we want the vector to conatin only NoDirection edges.
}
// else, the inverted edge is already in the graph -> do nothing.
}
/*********************************************************************/
/*
* Removes the Edges: (ver1, ver2) & (ver2, ver1) from the graph.
*
* ASSUMPTION: if the edge (ver1, ver2) is in the graph, the inverted edge (ver2, ver1) is also in the graph.
*/
void Graph::RemoveEdge(int ver1, int ver2)
{
if (!IsAdjacent(ver1, ver2))
{
cout << "The Edge (" << ver1 << "," << ver2 << ") is not in the graph" << endl;
}
else
{
adjList[ver1 - 1]->removeFromList(ver2 - 1);
adjList[ver2 - 1]->removeFromList(ver1 - 1); // remove the inverted edge
// remove from edges:
for (int i = 0; i < edges.size(); i++) {
if ((edges[i].ver1 == ver1 - 1 && edges[i].ver2 == ver2 - 1) || (edges[i].ver1 == ver2 - 1 && edges[i].ver2 == ver1 - 1)) {
// bring edges[i] to the end of edges and then pop it (to keep edges sorted)
for (int j = i; j < edges.size() - 1; j++) {
std::swap(edges[j], edges[j + 1]);
}
edges.pop_back();
break;
i = edges.size(); // to finish the loop
}
}
}
}
/*********************************************************************/
void Graph::makeColorsWhite()
{
for (int i = 0; i < Num_of_Vertices; i++)
{
colors[i] = WHITE;
}
this->colorsIsWhite = true;
}
/*********************************************************************/
void Graph::visit(int vertex)
{
colors[vertex] = GRAY;
Node *curr = adjList[vertex]->getHead();
while (curr != nullptr)
{
if (colors[curr->getVertex()] == WHITE)
{
colors[curr->getVertex()] = GRAY;
visit(curr->getVertex());
}
curr = curr->getNext();
}
colors[vertex] = BLACK;
}
/*********************************************************************/
bool Graph::isConnectedGraph()
{
if (!this->colorsIsWhite)
makeColorsWhite();
visit(0);
this->colorsIsWhite = false;
for (int i = 0; i < Num_of_Vertices; i++)
{
if (colors[i] != BLACK)
return false;
}
return true;
}
/*********************************************************************/
vector<weightedEdge> Graph::getWeightedEdgesVector() {
// IMPORTANT: NO DUP EDGES!!
return this->edges;
}
/*********************************************************************/
/*
* in case a vertex doesn't have edges attached to it, printGraph prints an empty line.
*/
void Graph::printGraph()
{
for (int i = 0; i < Num_of_Vertices; i++)
{
adjList[i]->printList(i + 1);
cout << endl;
}
}
/*********************************************************************/
// Getters:
/*********************************************************************/
int Graph::get_Num_of_Vertices() {
return this->Num_of_Vertices;
}
int Graph::get_Num_of_Edges() {
return this->edges.size();
}
bool Graph::get_edgesIsSorted() {
return this->edgesIsSorted;
}
int Graph::get_edgesSize() {
return this->edges.size();
}
/*********************************************************************/
// Setters:
/*********************************************************************/
void Graph::set_edgesIsSorted(bool newVal) {
this->edgesIsSorted = newVal;
}
/*********************************************************************/
/*
* This funciton Sorts the edges vector according to the Quick Sort Algorithm, By weight
* edges[i] = {vec1, vec2, weight}
*/
void Graph::QuickSort(int begin, int end)
{
// Sort Edges By weight
int pivot;
if (begin < end)
{
pivot = Partition(begin, end);
QuickSort(begin, pivot - 1);
QuickSort(pivot + 1, end);
}
}
/*********************************************************************/
int Graph::Partition(int begin, int end)
{
// By weight
weightedEdge pivotEdge = edges[end];
int indP = begin; // Index of smaller element and indicates the right position of pivot found so far
for (int j = begin; j <= end - 1; j++) // check from begin to end - 1 (end is pivot)
{
// If current element is smaller than the pivot
if (edges[j].weight < pivotEdge.weight)
{
swap(edges[indP], edges[j]);
indP++; // increment index of position of Pivot in the vector
}
}
swap(edges[indP], edges[end]);
return indP;
}
/*********************************************************************/
void Graph::swap(weightedEdge& edge1, weightedEdge& edge2)
{
weightedEdge t = edge1;
edge1 = edge2;
edge2 = t;
}
/*********************************************************************/