Update Dijkstra - verifiy if infeasible

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());