doc(dijkstra): explain why we use an ArrayList

2024-04-26 17:35:37 +02:00 · 2024-04-26 17:35:37 +02:00 · 5dfd14f3f2
commit 5dfd14f3f2
parent e5be8087f9
1 changed files with 2 additions and 0 deletions
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
@ -36,6 +36,8 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {

        // Init Dijkstra
        for (Node node : graph.getNodes()) {
+            // Luckily they are ordered by id.
+            // ArrayList.set only works if the value is already initialized (because why Java?)
            labels.add(new Label(node));
        }