ymahe/BE-Graphes-MAHE-MOLL
1
0
Fork 0
forked from lebotlan/BE-Graphes
Code Pull requests Activity

Update Dijkstra (all notify working)

Browse source
This commit is contained in:
Sebastien Moll 2026-05-06 16:37:34 +02:00
parent e249625793
commit 23be38ee2b
1 changed files with 4 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
View file

@ -48,7 +48,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
while (!found && !labelsHeap.isEmpty()) {
concurentNodeLabel = labelsHeap.deleteMin();
if (!concurentNodeLabel.getMarque()) {
notifyNodeReached(concurentNodeLabel.getSommetCourant());
notifyNodeMarked(concurentNodeLabel.getSommetCourant());
concurentNodeLabel.setMarque();
for (Arc arc : concurentNodeLabel.getSommetCourant().getSuccessors()) {
@ -59,6 +59,9 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
Label successorLabel = labelsList.get(arc.getDestination().getId());
Double newCost = data.getCost(arc) + concurentNodeLabel.getCost();
if (successorLabel.getCost() == Double.POSITIVE_INFINITY) {
notifyNodeReached(arc.getDestination());
}
if (newCost < successorLabel.getCost()) {
successorLabel.setPere(arc);
successorLabel.setCoutRealise(newCost);