routingkit-cch 0.1.4

Rust bindings for RoutingKit's Customizable Contraction Hierarchies (CCH)
Documentation 
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

#include <routingkit/vector_io.h>
#include <routingkit/permutation.h>
#include <routingkit/inverse_vector.h>
#include <routingkit/contraction_hierarchy.h>
#include <routingkit/min_max.h>
#include <routingkit/timer.h>

#include <iostream>
#include <stdexcept>
#include <vector>

using namespace RoutingKit;
using namespace std;

int main(int argc, char*argv[]){

	try{
		string ch_file;
		
		if(argc != 2){
			cerr << argv[0] << " ch_file" << endl;
			return 1;
		}else{
			ch_file = argv[1];
		}

		cout << "Loading Contraction Hierarchy ... " << flush;

		ContractionHierarchy ch = ContractionHierarchy::load_file(ch_file);

		cout << "done" << endl;

		cout << "Generating queries ... " << flush;

		const unsigned
			source_count = 500,
			target_count = 500;

		std::vector<unsigned>
			source_set(source_count),
			target_set(target_count);

		for(unsigned i=0; i<source_count; ++i)
			source_set[i] = rand() % ch.node_count();
		for(unsigned i=0; i<target_count; ++i)
			target_set[i] = rand() % ch.node_count();
		
		
		std::vector<unsigned>optimal_result(source_count * target_count);

		cout << "done" << endl;
		
		{
			long long time = -get_micro_time();
			cout << "Running baseline ... " << flush;
		
			ContractionHierarchyQuery ch_query(ch);
			for(unsigned s=0; s<source_count; ++s){
				for(unsigned t=0; t<target_count; ++t){
					optimal_result[s*target_count + t] = ch_query.reset().add_source(source_set[s]).add_target(target_set[t]).run().get_distance();
				}
			}

			time += get_micro_time();

			cout << "done ["<<time << "musec]" << endl;
		}

		std::vector<unsigned>pinned_source_result(source_count * target_count);

		{


			long long select_time = 0;
			unsigned select_count = 0;
			long long query_time = 0;
			unsigned query_count = 0;

			long long time = -get_micro_time();
			cout << "Running forward pinning ... " << flush;
		
			ContractionHierarchyQuery ch_query(ch);

			select_time -= get_micro_time();
			ch_query.reset();
			ch_query.pin_targets(target_set);
			select_time += get_micro_time();
			++select_count;

			for(unsigned s=0; s<source_count; ++s){

				query_time -= get_micro_time();
				auto d = ch_query.reset_source().add_source(source_set[s]).run_to_pinned_targets().get_distances_to_targets();

				for(unsigned t=0; t<target_count; ++t){
					pinned_source_result[s*target_count + t] = d[t];
				}
				query_time += get_micro_time();
				++query_count;
			}

			time += get_micro_time();

			cout << "done ["<<time << "musec]" << endl;

			cout << "query_time" << " : " << query_time / query_count << "musec" << endl;
			cout << "pin_time" << " : " << select_time / select_count << "musec" << endl;
		}

		if(pinned_source_result != optimal_result){
			cout << "Pinned source is not correct" << endl;
		} else {
			cout << "No error with pinned source found" << endl;
		}

		std::vector<unsigned>pinned_target_result(source_count * target_count);

		{


			long long select_time = 0;
			unsigned select_count = 0;
			long long query_time = 0;
			unsigned query_count = 0;

			long long time = -get_micro_time();
			cout << "Running forward pinning ... " << flush;
		
			ContractionHierarchyQuery ch_query(ch);

			select_time -= get_micro_time();
			ch_query.reset();
			ch_query.pin_sources(source_set);
			select_time += get_micro_time();
			++select_count;

			for(unsigned t=0; t<target_count; ++t){

				query_time -= get_micro_time();
				auto d = ch_query.reset_target().add_target(target_set[t]).run_to_pinned_sources().get_distances_to_sources();
				for(unsigned s=0; s<source_count; ++s){
					pinned_target_result[s*target_count + t] = d[s];
				}
				query_time += get_micro_time();
				++query_count;
			}

			time += get_micro_time();

			cout << "done ["<<time << "musec]" << endl;

			cout << "query_time" << " : " << query_time / query_count << "musec" << endl;
			cout << "pin_time" << " : " << select_time / select_count << "musec" << endl;

		}

		if(pinned_target_result != optimal_result){
			cout << "Pinned target is not correct" << endl;
		} else {
			cout << "No error with pinned target found" << endl;
		}

	}catch(exception&err){
		cerr << "Stopped on exception : " << err.what() << endl;
		return 1;
	}
	return 0;
}