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

petite modification ajoutee pour utiliser notifyNodeMarked

Browse source
This commit is contained in:
Thior Youssouf-Ben-Abdallah 2025-05-21 15:56:46 +02:00
parent 3a6de0eddb
commit 640f2140ba
1 changed files with 1 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -104,6 +104,7 @@ public class AStarAlgorithm extends DijkstraAlgorithm {
IdxNewOrigin = minHeap.deleteMin().currentNode.getId(); IdxNewOrigin = minHeap.deleteMin().currentNode.getId();
labels[IdxNewOrigin].mark = true; labels[IdxNewOrigin].mark = true;
notifyNodeMarked(labels[IdxNewOrigin].currentNode);
//notifyNodeMarked(labels[IdxNewOrigin].currentNode); //notifyNodeMarked(labels[IdxNewOrigin].currentNode);
for (Arc arc : labels[IdxNewOrigin].currentNode.getSuccessors()) { // le arrayList de getSucessors, ça ne retourne que des arc forward. donc pas besoin de vérifier qui est l'origine o`u la destination for (Arc arc : labels[IdxNewOrigin].currentNode.getSuccessors()) { // le arrayList de getSucessors, ça ne retourne que des arc forward. donc pas besoin de vérifier qui est l'origine o`u la destination