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

fix(dijkstra): filter invalid arcs during reconstruction

Browse source
This commit is contained in:
Paul Alnet 2024-05-03 13:58:13 +02:00
parent 5363dd1a89
commit 224ab4a97d
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -110,7 +110,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
// current node and add it to the path // current node and add it to the path
if (parent_label != null) { if (parent_label != null) {
for (Arc arc : parent_label.getNode().getSuccessors()) { for (Arc arc : parent_label.getNode().getSuccessors()) {
if (arc.getDestination().getId() == current_label.getNode().getId()) { if (arc.getDestination().getId() == current_label.getNode().getId() && data.isAllowed(arc)) {
arcs_path.add(arc); arcs_path.add(arc);
break; break;
} }