From 91a24bf537371b36f29ca37b2d2dd0e25213397a Mon Sep 17 00:00:00 2001
From: Huyen Chau Nguyen <hello@chau-nguyen.de>
Date: Sun, 9 Sep 2018 22:12:32 +0300
Subject: [PATCH] i dun understannnnd

---
 include/util/node_based_graph.hpp | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/include/util/node_based_graph.hpp b/include/util/node_based_graph.hpp
index 8decb9aad..1300b0dae 100644
--- a/include/util/node_based_graph.hpp
+++ b/include/util/node_based_graph.hpp
@@ -10,6 +10,7 @@
 #include <tbb/parallel_sort.h>
 
 #include <memory>
+#include <iostream>
 #include <utility>
 
 namespace osrm
@@ -87,9 +88,13 @@ NodeBasedDynamicGraphFromEdges(NodeID number_of_nodes,
             output_edge.data.flags = input_edge.flags;
             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.distance > 0);
+
+            BOOST_ASSERT(output_edge.data.weight >= 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());