diff --git a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/DijkstraAlgorithmTest.java b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/DijkstraAlgorithmTest.java
index aca0909..3c650cc 100644
--- a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/DijkstraAlgorithmTest.java
+++ b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/DijkstraAlgorithmTest.java
@@ -131,11 +131,9 @@ public class DijkstraAlgorithmTest {
         ShortestPathAlgorithm A_star= new AStarAlgorithm(data);
         ShortestPathSolution soluce_Dijkstra= Dijkstra.run();
         ShortestPathSolution soluce_Astar= A_star.run();
-        boolean result = false;
-        if (soluce_Dijkstra.getSolvingTime().toSeconds() > soluce_Astar.getSolvingTime().toSeconds()){
-            result = true;
-        }
-        assertTrue(result);
+      
+        assertTrue(Long.compare(soluce_Dijkstra.getSolvingTime().toSeconds(),soluce_Astar.getSolvingTime().toSeconds())>=0); 
+       
     }
 
 
@@ -162,7 +160,7 @@ public class DijkstraAlgorithmTest {
     @Test
     public void Carte_Time() throws Exception{
 
-        //Nous allons cherche lee chemin et la carte a analyser
+        //Nous allons cherche le chemin et la carte a analyser
         final String map_c = "/mnt/commetud/3eme Annee MIC/Graphes-et-Algorithmes/Maps/carre-dense.mapgr";
         final GraphReader reader = new BinaryGraphReader(new DataInputStream(new BufferedInputStream(new FileInputStream(map_c))));
         Graph graph_c = reader.read();