-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraph.cpp
More file actions
89 lines (76 loc) · 3.17 KB
/
Copy pathGraph.cpp
File metadata and controls
89 lines (76 loc) · 3.17 KB
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
//----------------------------------------------------------------
//Author: Karl Anthony James
//E-Mail: kjames21@uco.edu
//Course: CMSC 3613 - Data Structures and Algorithms
//CRN: 26119, Spring 2013
//Project: PA3
//Due: April 20, 2013
//Account gp034
//----------------------------------------------------------------
#include "Graph.h"
using namespace std;
void Graph::addEdge(int verticeOne, int verticeTwo, int weight){
this->vertices[verticeOne].push_back(Edge(verticeTwo, weight));
this->vertices[verticeTwo].push_back(Edge(verticeOne, weight));
}
void Graph::setNumberVertices(int numberOfVertices){
this->numberOfVertices = numberOfVertices;
}
int Graph::getNumberOfVertices(){
return this->numberOfVertices;
}
void Graph::initializeSingleSource(int source){
for(int i = 1; i <= this->numberOfVertices; i++){
this->pathDistances[i] = -1;
this->pathDiscovered[i] = false;
this->verticePredecessor[i] = -1;
}
while(!this->discoveryQueue.empty()){
this->discoveryQueue.pop();
}
this->pathDistances[source] = 0;
this->verticePredecessor[source] = -1;
this->discoveryQueue.push(Edge(source, 0));
}
void Graph::analyzeShortestPathsWithDijkstra(int source){
this->initializeSingleSource(source);
while(!this->discoveryQueue.empty()){
int discoveryVertice = this->discoveryQueue.top().vertice;
this->discoveryQueue.pop();
if(this->pathDiscovered[discoveryVertice]) continue;
int numberOfAdjacentVertices = this->vertices[discoveryVertice].size();
for(int i=0; i < numberOfAdjacentVertices; i++) {
int adjacentVertice = this->vertices[discoveryVertice][i].vertice;
int weight = this->vertices[discoveryVertice][i].weight;
if(!this->pathDiscovered[adjacentVertice]
&& (this->pathDistances[adjacentVertice] == -1
|| this->pathDistances[discoveryVertice] + weight < this->pathDistances[adjacentVertice])) {
this->pathDistances[adjacentVertice] = this->pathDistances[discoveryVertice] + weight;
this->verticePredecessor[adjacentVertice] = discoveryVertice;
this->discoveryQueue.push(Edge(adjacentVertice, this->pathDistances[adjacentVertice]));
}
}
this->pathDiscovered[discoveryVertice] = true;
}
}
void Graph::analyzeMinimumSpanningTreeWithPrims(int source){
this->initializeSingleSource(source);
while(!this->discoveryQueue.empty()){
int discoveryVertice = this->discoveryQueue.top().vertice;
this->discoveryQueue.pop();
if(this->pathDiscovered[discoveryVertice]) continue;
int numberOfAdjacentVertices = this->vertices[discoveryVertice].size();
for(int i=0; i < numberOfAdjacentVertices; i++) {
int adjacentVertice = this->vertices[discoveryVertice][i].vertice;
int weight = this->vertices[discoveryVertice][i].weight;
if(!this->pathDiscovered[adjacentVertice]
&& (this->pathDistances[adjacentVertice] == -1
|| weight < this->pathDistances[adjacentVertice])) {
this->pathDistances[adjacentVertice] = weight;
this->verticePredecessor[adjacentVertice] = discoveryVertice;
this->discoveryQueue.push(Edge(adjacentVertice, this->pathDistances[adjacentVertice]));
}
}
this->pathDiscovered[discoveryVertice] = true;
}
}