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

dijkstra: functional

Browse source
This commit is contained in:
Clement Lacau 2024-04-20 19:21:26 +02:00
parent 26e5d5dac9
commit ceeb5e1203
1 changed files with 1 additions and 1 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

@ -100,7 +100,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
// We will find the path using the parent nodes, from the destination to the origin // We will find the path using the parent nodes, from the destination to the origin
Node current_node = data.getDestination(); Node current_node = data.getDestination();
Label current_label = new Label(current_node); Label current_label = new Label(current_node);
System.out.println(current_node.getId()); // System.out.println(current_node.getId());
while (current_node != null && current_node != data.getOrigin()) { while (current_node != null && current_node != data.getOrigin()) {
// Find the label matching the parent node // Find the label matching the parent node