Fix range check

stdgraph · Dec 21, 2023 · 3f33630 · 3f33630
1 parent c5780e5
commit 3f33630
Showing 1 changed file with 8 additions and 5 deletions.
diff --git a/include/graph/algorithm/shortest_paths.hpp b/include/graph/algorithm/shortest_paths.hpp
@@ -16,6 +16,7 @@
 #include <queue>
 #include <vector>
 #include <ranges>
+#include <fmt/format.h>
 #include "graph/graph.hpp"
 
 #ifndef GRAPH_SHORTEST_PATHS_HPP
@@ -165,8 +166,9 @@ void dijkstra_shortest_paths(
   using weight_type = invoke_result_t<WF, edge_reference_t<G>>;
 
   size_t N(num_vertices(g));
-  if (source < N || source >= 0)
-    throw out_of_range("source is outside the vertices range");
+  if (source < 0 || source >= N) {
+    throw out_of_range(fmt::format("source {} is outside the vertices range [{},{})", source, 0, N));
+  }
 
   //std::ranges::fill(distances, numeric_limits<weight_type>::max());
   distances[source] = 0;
@@ -275,9 +277,10 @@ void dijkstra_shortest_paths(
   using id_type     = vertex_id_t<G>;
   using weight_type = invoke_result_t<WF, edge_reference_t<G>>;
 
-  size_t N(num_vertices(g));
-  if (source < N || source >= 0)
-    throw out_of_range("source is outside the vertices range");
+  const size_t N(num_vertices(g));
+  if (source < 0 || source >= N) {
+    throw out_of_range(fmt::format("source {} is outside the vertices range [{},{})", source, 0, N));
+  }
 
   //std::ranges::fill(distances, numeric_limits<weight_type>::max());
   distances[source] = 0;