From 3df94a9cec7cdb5f949b45dbbc673ca6975272ce Mon Sep 17 00:00:00 2001
From: moll <moll@insa-toulouse.fr>
Date: Wed, 6 May 2026 18:09:22 +0200
Subject: [PATCH] Update Dijkstra - verifiy if infeasible

---
 .../graphs/algorithm/shortestpath/DijkstraAlgorithm.java     | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
index 6e2fb21..ad56d94 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
@@ -73,6 +73,11 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
                 }
             }
         } 
+
+        // Destination has no predecessor, the solution is infeasible...
+        if (destinationNodeLabel.getPere() == null) {
+            return new ShortestPathSolution(data, Status.INFEASIBLE);
+        }
         
         notifyDestinationReached(data.getDestination());