diff --git a/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs b/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs
index 738b53016..8fd943e6e 100644
--- a/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs
+++ b/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs
@@ -237,7 +237,7 @@ impl<G: RankingRuleGraphTrait> RankingRuleGraph<G> {
     ) {
         // Traverse the graph backward from the target node, recomputing the cost for each of its predecessors.
         // We first check that no other node is contributing the same total cost to a predecessor before removing
-        // the cost from the predecessor. 
+        // the cost from the predecessor.
         self.traverse_breadth_first_backward(node_with_removed_outgoing_conditions, |cur_node| {
             let mut costs_to_remove = FxHashSet::default();
             costs_to_remove.extend(costs.get(cur_node).iter().copied());