From efeba4104c7e1fdb599a6566b185ebc5868da7db Mon Sep 17 00:00:00 2001 From: Gasson-Betuing Danyl Date: Tue, 20 May 2025 13:47:52 +0200 Subject: [PATCH] =?UTF-8?q?Dijkstra=20et=20A*=20corrig=C3=A92.1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java index 5a7c102..92763b0 100644 --- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java +++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java @@ -121,8 +121,7 @@ public class AStarAlgorithm extends DijkstraAlgorithm { // to observe the path search - if (Double.isInfinite(OldCost) - && Double.isFinite(NewCost)) { + if (Double.isInfinite(OldCost) && Double.isFinite(NewCost)) { notifyNodeReached(arc.getDestination()); }