forked from AutoProving/3TST
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dijkstra.cpp
182 lines (169 loc) · 7.21 KB
/
dijkstra.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
#include "dijkstra.hpp"
bool cmp(const pair<Weight, Vertex> &x, const pair<Weight, Vertex> &y) {
return x.first > y.first;
}
void dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
Vertex source) {
min_distance[source] = 0;
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.push_back({0, source});
vector<bool> notseen(adjList.size(), true);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
}
void dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
set<pair<Weight, Vertex>> &set_active_vertices) {
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.insert(active_vertices.begin(), set_active_vertices.begin(),
set_active_vertices.end());
vector<bool> notseen(adjList.size(), true);
make_heap(active_vertices.begin(), active_vertices.end(), cmp);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
}
Vertex dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
Vertex source, const vector<int> &terminalsMap, int T) {
min_distance[source] = 0;
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.push_back({0, source});
vector<bool> notseen(adjList.size(), true);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
if (terminalsMap[where] != -1)
--T;
if (T == 0)
return where;
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
return -1;
}
Vertex dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
Tree &T,
set<pair<Weight, Vertex>> &set_active_vertices) {
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.insert(active_vertices.begin(), set_active_vertices.begin(),
set_active_vertices.end());
vector<bool> notseen(adjList.size(), true);
make_heap(active_vertices.begin(), active_vertices.end(), cmp);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
if (T.tree[where].parent > -2)
return where;
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
return -1;
}
void dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
Vertex source, Vertex target) {
min_distance[source] = 0;
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.push_back({0, source});
vector<bool> notseen(adjList.size(), true);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
if (where == target)
return;
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
}
void dijkstra(const vector<map<Vertex, Weight>> &adjList,
vector<Weight> &min_distance, vector<Vertex> &origin,
Vertex source, Vertex v1, Vertex v2) {
min_distance[source] = 0;
vector<pair<Weight, Vertex>> active_vertices;
active_vertices.reserve(adjList.size());
active_vertices.push_back({0, source});
vector<bool> notseen(adjList.size(), true);
while (!active_vertices.empty()) {
std::pop_heap(active_vertices.begin(), active_vertices.end(), cmp);
Vertex where = active_vertices.back().second;
active_vertices.pop_back();
if (notseen[where]) {
if (where == v1 || where == v2)
return;
for (std::map<Vertex, Weight>::const_iterator it = adjList[where].begin();
it != adjList[where].end(); ++it)
if (min_distance[it->first] > min_distance[where] + it->second) {
min_distance[it->first] = min_distance[where] + it->second;
origin[it->first] = where;
active_vertices.push_back({min_distance[it->first], it->first});
push_heap(active_vertices.begin(), active_vertices.end(), cmp);
}
notseen[where] = false;
}
}
}