Update editoast/src/views/infra/pathfinding.rs

Co-authored-by: bougue-pe <[email protected]>

Author: Tristramg

editoast/src/views/infra/pathfinding.rs

@@ -199,7 +199,7 @@ fn compute_path(
         .clone()
         .union(&ending_track.bbox_geo)
         .diagonal_length();
-    // We build an upper bound that is the diagonal of the bounding bex covering start and end
+    // We build an upper bound that is the diagonal of the bounding box covering start and end
     // During the path search, we prune any route that is twice that distance
     // We set an upper bound of at least 10 km to avoid problems on very short distances
     let mut best_distance = into_cost(best_distance.min(10_000.0));