Update app.py

app.py

@@ -130,11 +130,14 @@ def dijkstra(distances: np.ndarray, start_idx: int) -> Tuple[List[int], Dict[int
     
     # Reconstruct the optimal route
     optimal_order = []
-    node = n - 1
-    while prev_node[node] != -1:
-        optimal_order.insert(0, node)
-        node = prev_node[node]
-    optimal_order.insert(0, start_idx)
+    for i in range(n):
+        node = i
+        while prev_node[node] != -1:
+            optimal_order.insert(0, node)
+            node = prev_node[node]
+        if len(optimal_order) > 0 and optimal_order[0] == i:
+            optimal_order.insert(0, start_idx)
+            break
     
     return optimal_order, distances_to