From d53cc298d908db43dc2a53fed9190cf99b8761a5 Mon Sep 17 00:00:00 2001
From: moll <moll@insa-toulouse.fr>
Date: Mon, 20 Apr 2026 06:50:49 +0200
Subject: [PATCH] DONE Dijsktra

---
 .../graphs/algorithm/shortestpath/DijkstraAlgorithm.java     | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git 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
index e264459..5725002 100644
--- 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
@@ -39,7 +39,6 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         Label destinationNodeLabel = labelsList.get(data.getDestination().getId());
         Label concurentNodeLabel = labelsList.get(data.getOrigin().getId());
         concurentNodeLabel.setCoutRealise(0);
-        concurentNodeLabel.setMarque();
 
         notifyOriginProcessed(data.getOrigin());
         
@@ -72,11 +71,11 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         ArrayList<Arc> pathArcs = new ArrayList<Arc>();
         concurentNodeLabel = destinationNodeLabel;
         while(concurentNodeLabel.getPere() != null) {
-        	pathArcs.add(concurentNodeLabel.getPere());
+        	pathArcs.add(0, concurentNodeLabel.getPere());
         	concurentNodeLabel = labelsList.get(concurentNodeLabel.getPere().getOrigin().getId());
         }
         
-        Collections.reverse(pathArcs);
+        // Collections.reverse(pathArcs);
         
         solution = new ShortestPathSolution(data, Status.OPTIMAL, new Path(graph, pathArcs));