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

roads allowed feat

Browse source
This commit is contained in:
Clement Lacau 2024-04-26 17:52:00 +02:00
parent 5dfd14f3f2
commit 429a22fcd9
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

@ -63,7 +63,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
for (Arc successorArc : x.getNode().getSuccessors()) { for (Arc successorArc : x.getNode().getSuccessors()) {
Label successor = labels.get(successorArc.getDestination().getId()); Label successor = labels.get(successorArc.getDestination().getId());
if (!successor.isMarked()) { if (!successor.isMarked() && data.isAllowed(successorArc)) {
// This loop serves to get the lentgh of the arc as // This loop serves to get the lentgh of the arc as
// we know its origin and destination // we know its origin and destination
for (Arc arc : x.getNode().getSuccessors()) { for (Arc arc : x.getNode().getSuccessors()) {