rees/Graphes_REES_KOUTSODIMA
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

dijkstra

Browse source
This commit is contained in:
Georgia Koutsodima 2023-04-12 16:14:38 +02:00
parent c81a209b5a
commit 14240bbf30
1 changed files with 29 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -1,8 +1,13 @@
package org.insa.graphs.algorithm.shortestpath; package org.insa.graphs.algorithm.shortestpath;
import org.insa.graphs.model.Node; import org.insa.graphs.model.Node;
import org.insa.graphs.model.Arc; import org.insa.graphs.model.Arc;
import org.insa.graphs.algorithm.AbstractSolution.Status;
import org.insa.graphs.model.Graph;
import org.insa.graphs.model.Path;
import java.util.ArrayList; import java.util.ArrayList;
import java.util.Collections;
import org.insa.graphs.algorithm.utils.BinaryHeap; import org.insa.graphs.algorithm.utils.BinaryHeap;
@ -28,7 +33,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
Label label_origine = tab.get(data.getOrigin().getId()); Label label_origine = tab.get(data.getOrigin().getId());
label_origine.setCoutmin(0); label_origine.setCoutmin(0);
Label label_dest =tab.get(data.getDestination().getId()) Label label_dest =tab.get(data.getDestination().getId());
/*insertion de label origine dans le tas */ /*insertion de label origine dans le tas */
tas.insert(label_origine); tas.insert(label_origine);
Label x; Label x;
@ -53,6 +58,29 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
} }
} }
} }
// On n'a pas trouvé de solution, on est sorti de la boucle car le tas est vide
if (label_dest.getMarque()==false) {
solution = new ShortestPathSolution(data, Status.INFEASIBLE);
}
else {
// The destination has been found, notify the observers.
notifyDestinationReached(data.getDestination());
// Create the path from the array of predecessors...
ArrayList<Arc> arcs = new ArrayList<>();
Arc arc = label_dest.getPere();
while (arc != null) {
arcs.add(arc);
arc = tab.get(arc.getOrigin().getId()).getPere();
}
// Reverse the path...
Collections.reverse(arcs);
// Create the final solution.
solution = new ShortestPathSolution(data, Status.OPTIMAL, new Path(data.getGraph(), arcs));
}
return solution; return solution;