-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathmain.cpp
45 lines (39 loc) · 1.29 KB
/
main.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
/*---------------------------------------------------------------------
Copyright 2019 Paolo G. Crosetto <pacrosetto@gmail.com>
SPDX-License-Identifier: Apache-2.0
---------------------------------------------------------------------*/
#include "../../src/cupq.h"
#include "dijkstra.h"
#include <algorithm>
#include <vector>
int main(int argc, char **argv) {
unsigned norigins = 1024;
unsigned ndestinations = 1;
std::vector<int> origins(norigins, 0);
std::vector<int> destinations(ndestinations, 0);
#ifdef CPU_COMPARISON
auto vec1 =
#endif
dijkstra_gpu(argc, argv, origins, destinations);
#ifdef CPU_COMPARISON
if (vec1.size()) {
std::cout << "total origins: " << origins.size();
std::cout << " total destinations: " << destinations.size() << "\n";
auto vec2 = dijkstra_cpu(argc, argv, origins, destinations);
std::cout << "Comparing results\n";
bool OK = true;
for (std::size_t k = 0; k < vec2.size(); ++k) {
if (vec1[k] != vec2[k]) {
std::cout << "Error in verification\n";
std::cout << "[" << k << "]" << vec1[k] << " != " << vec2[k] << "\n";
OK = false;
} else {
// std::cout<<"OK\n";
// std::cout<<"[" << k << "]" <<vec1[k] <<" == " <<vec2[k] <<"\n";
}
}
if (OK)
std::cout << "OK\n";
}
#endif
}