gasson-b/Projet_Graphe
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Dijkstra et A* corrigé

Browse source
This commit is contained in:
Gasson-Betuing Danyl 2025-05-20 10:24:41 +02:00
parent 23199c947f
commit c38b7448c7
2 changed files with 2 additions and 2 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/AStarAlgorithm.java
View file

@ -81,7 +81,7 @@ public class AStarAlgorithm extends DijkstraAlgorithm {
OldDist = labels[arc.getDestination().getId()].computedCost;
EstimatedCost = labels[arc.getDestination().getId()].destCost;
NewDist = labels[IdxNewOrigin].computedCost + arc.getLength(); // calcul de la nouvelle distance
NewDist = labels[IdxNewOrigin].computedCost + data.getCost(arc); // calcul de la nouvelle distance/temps
// to observe the path search

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

@ -71,7 +71,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
if (!labels[arc.getDestination().getId()].mark){ // verif du marquage
NewDist = labels[IdxNewOrigin].computedCost + arc.getLength(); // calcul de la nouvelle distance
NewDist = labels[IdxNewOrigin].computedCost + data.getCost(arc); // calcul de la nouvelle distance
OldDist = labels[arc.getDestination().getId()].computedCost; // lecture de l'ancienne
if (Double.isInfinite(OldDist)