fofana/Be_Graphe
2
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Ajout finalisation test Solving Time

Browse source
This commit is contained in:
El Haji Fofana 2023-05-20 16:51:33 +02:00
parent 268ed91e85
commit ac09b33f99
1 changed files with 4 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/DijkstraAlgorithmTest.java
View file

@ -131,11 +131,9 @@ public class DijkstraAlgorithmTest {
ShortestPathAlgorithm A_star= new AStarAlgorithm(data); ShortestPathAlgorithm A_star= new AStarAlgorithm(data);
ShortestPathSolution soluce_Dijkstra= Dijkstra.run(); ShortestPathSolution soluce_Dijkstra= Dijkstra.run();
ShortestPathSolution soluce_Astar= A_star.run(); ShortestPathSolution soluce_Astar= A_star.run();
boolean result = false;
if (soluce_Dijkstra.getSolvingTime().toSeconds() > soluce_Astar.getSolvingTime().toSeconds()){ assertTrue(Long.compare(soluce_Dijkstra.getSolvingTime().toSeconds(),soluce_Astar.getSolvingTime().toSeconds())>=0);
result = true;
}
assertTrue(result);
} }
@ -162,7 +160,7 @@ public class DijkstraAlgorithmTest {
@Test @Test
public void Carte_Time() throws Exception{ 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 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)))); final GraphReader reader = new BinaryGraphReader(new DataInputStream(new BufferedInputStream(new FileInputStream(map_c))));
Graph graph_c = reader.read(); Graph graph_c = reader.read();