lacau/BE_Graphes
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

fix(dijkstra): observers

Browse source
This commit is contained in:
Paul Alnet 2024-05-03 12:52:29 +02:00
parent c223936743
commit dcc2bc0746
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -55,8 +55,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
while (!tas.isEmpty() && !(labels.get(dest_id).getNode().equals(x.getNode()))) { while (!tas.isEmpty() && !(labels.get(dest_id).getNode().equals(x.getNode()))) {
x = tas.deleteMin(); x = tas.deleteMin();
x.mark(); x.mark();
// A marked node is considered as reached notifyNodeMarked(x.getNode());
notifyNodeReached(x.getNode());
// We create a list of node successors of x, instead of a list of Arcs. // We create a list of node successors of x, instead of a list of Arcs.
float arc_cost = 0; float arc_cost = 0;
@ -86,6 +85,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
else { else {
tas.insert(successor); tas.insert(successor);
} }
notifyDestinationReached(successor.getNode());
} }
} }
} }