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

doc(dijkstra): explain why we use an ArrayList

Browse source
This commit is contained in:
Paul Alnet 2024-04-26 17:35:37 +02:00
parent e5be8087f9
commit 5dfd14f3f2
1 changed files with 2 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
View file

@ -36,6 +36,8 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
// Init Dijkstra // Init Dijkstra
for (Node node : graph.getNodes()) { 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)); labels.add(new Label(node));
} }