Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

i dun understannnnd

Browse Source
This commit is contained in:
Huyen Chau Nguyen 2018-09-09 22:12:32 +03:00
parent 01f050cebb
commit 91a24bf537
1 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/util/node_based_graph.hpp
View File

@ -10,6 +10,7 @@
#include <tbb/parallel_sort.h> #include <tbb/parallel_sort.h>
#include <memory> #include <memory>
#include <iostream>
#include <utility> #include <utility>
namespace osrm namespace osrm
@ -87,9 +88,13 @@ NodeBasedDynamicGraphFromEdges(NodeID number_of_nodes,
output_edge.data.flags = input_edge.flags; output_edge.data.flags = input_edge.flags;
output_edge.data.annotation_data = input_edge.annotation_data; output_edge.data.annotation_data = input_edge.annotation_data;
BOOST_ASSERT(output_edge.data.weight > 0);
BOOST_ASSERT(output_edge.data.duration > 0); BOOST_ASSERT(output_edge.data.weight >= 0);
BOOST_ASSERT(output_edge.data.distance > 0); BOOST_ASSERT(output_edge.data.duration >= 0);
if (output_edge.data.distance <= 0) {
std::cout << "output_edge.data.distance " << output_edge.data.distance << std::endl;
}
BOOST_ASSERT(output_edge.data.distance >= 0);
}); });
tbb::parallel_sort(edges_list.begin(), edges_list.end()); tbb::parallel_sort(edges_list.begin(), edges_list.end());