fix small bug with graph in shortest path

spirosmaggioros · Sep 7, 2024 · 40dd101 · 40dd101
1 parent 1e6e925
commit 40dd101
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/src/classes/graph/graph.h b/src/classes/graph/graph.h
@@ -847,7 +847,7 @@ template <typename T> double weighted_graph<T>::shortest_path(T start, T end) {
     dist[start] = 0;
     while (!pq.empty()) {
       T currentNode = pq.top().second;
-      T currentDist = pq.top().first;
+      double currentDist = pq.top().first;
       pq.pop();
       for (std::pair<T, double> &edge : adj[currentNode]) {
         if (currentDist + edge.second < dist[edge.first]) {