-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.cpp
49 lines (41 loc) · 1.08 KB
/
util.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
#include "algo.h"
bool TSP::isVisited(bool *arr) {
for(int i =0 ;i < n; i++) {
if (arr[i] == false) return false;
}
return true;
}
// Basic binary search. Disadvantage of adjacency list over matrix
int TSP::findIdx(int a, int val) {
int start = 0;
int end = adjlist[a].size() - 1;
int mid;
while (start <= end) {
mid = start + (end-start)/2;
if (adjlist[a][mid].first == val) return mid;
if (adjlist[a][mid].first < val) {
start = mid + 1;
} else {
end = mid - 1;
}
}
return -1;
}
void TSP::findOdds() {
for (int r = 0; r < n; r++) {
if ((multigraph[r].size() % 2) != 0 ) {
odds.push_back(r);
}
}
}
int TSP::getMinIndex(double weight[], bool mst[]) {
double min = std::numeric_limits<double>::max();
int min_index = -1;
for (int i = 0; i < n; i++) {
if (mst[i] == false && weight[i] < min) {
min = weight[i];
min_index = i;
}
}
return min_index;
}