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

fix(dijkstra): path reconstruction not choosing optimal arc

Browse source
This commit is contained in:
Paul Alnet 2024-05-20 23:55:01 +02:00
parent f4db47ee4e
commit fd69c3b30c
1 changed files with 8 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -122,12 +122,17 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
// Knowing the parent node, get the arc between the parent and // Knowing the parent node, get the arc between the parent and
// current node and add it to the path // current node and add it to the path
if (parent_label != null) { if (parent_label != null) {
double minCost = Double.MAX_VALUE;
Arc minCostArc = null;
for (Arc arc : parent_label.getNode().getSuccessors()) { for (Arc arc : parent_label.getNode().getSuccessors()) {
if (arc.getDestination().getId() == current_label.getNode().getId() && data.isAllowed(arc)) { if (arc.getDestination().getId() == current_label.getNode().getId()
arcs_path.add(arc); && data.isAllowed(arc)
break; && data.getCost(arc) < minCost) {
minCost = data.getCost(arc);
minCostArc = arc;
} }
} }
arcs_path.add(minCostArc);
} }
current_label = parent_label; current_label = parent_label;
} }