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

TIME mode

Browse source
This commit is contained in:
Clement Lacau 2024-05-18 17:05:39 +02:00
parent de65f817b1
commit 1c4bc2fb00
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

@ -74,7 +74,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
// we know its origin and destination
for (Arc arc : x.getNode().getSuccessors()) {
if (successor.getNode().equals(arc.getDestination())) {
arc_cost = arc.getLength();
arc_cost = (float) data.getCost(arc);
}
}
final float possible_path_cost = x.getCost() + arc_cost;
@ -140,7 +140,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
this.pathCost = labels.get(data.getDestination().getId()).getTotalCost();
}
return solution;
return solution;
}
public float getCostPath() {