refactor(test): for loop

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

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