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

refactor(test): for loop

Browse source
This commit is contained in:
Paul Alnet 2024-05-20 22:23:02 +02:00
parent 5c248f26dc
commit 0ad795a8c4
1 changed files with 1 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -48,8 +48,7 @@ public class DijkstraAlgorithmTest {
public static void init() { public static void init() {
try { try {
// Create the map // Create the map
for (int j = 0 ; j < Maps.size() ; j++) { for (String mapName : Maps) {
final String mapName = Maps.get(j);
// Create a graph reader // Create a graph reader
final GraphReader reader = new BinaryGraphReader( final GraphReader reader = new BinaryGraphReader(
new DataInputStream(new BufferedInputStream(new FileInputStream(mapName)))); new DataInputStream(new BufferedInputStream(new FileInputStream(mapName))));