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

test(dijkstra): fix git mishap

Browse source
This commit is contained in:
Paul Alnet 2024-05-17 08:41:24 +02:00
parent 0cfdaf1ef2
commit 6db6644828
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/test/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithmTest.java
View file

@ -70,6 +70,7 @@ public class DijkstraAlgorithmTest {
// appeler constructeur dijkstra
// donner le path à afficher en renvoyant le path de dijkstra dans path.
// Chemin court => Bellman OK et vérifié. On compare les résultats obtenus par les 2 algos
public void testToulouseCourtChemin() {
ArcInspector arcInspector;
ShortestPathData data = new ShortestPathData(this.graph, this.path.getOrigin(), this.path.getDestination(), null);
@ -79,7 +80,6 @@ public class DijkstraAlgorithmTest {
BellmanFordAlgorithm bellman = new BellmanFordAlgorithm(data);
ShortestPathSolution bell_path = bellman.doRun();
assert(dijk_path.getPath() == bell_path.getPath());
public void testToulouseCourtChemin() {
}
// Long chemin => Bellman trop long, on compare dijkstra au chemin récupéré directement