From 857b0215f4a61289be45248443edfba323b2b02c Mon Sep 17 00:00:00 2001
From: Benmouffok Helwen <benmouffok@insa-21055>
Date: Wed, 13 May 2026 18:12:04 +0200
Subject: [PATCH] =?UTF-8?q?impl=C3=A9mentation=20de=20label=20+=20debut=20?=
 =?UTF-8?q?Djikstra?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../shortestpath/DijkstraAlgorithm.java       | 33 +++++++++++
 .../graphs/algorithm/shortestpath/Label.java  | 56 +++++++++++++++++++
 .../main/java/org/insa/graphs/model/Path.java |  8 +--
 3 files changed, 92 insertions(+), 5 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 18a540f..22146c2 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
@@ -1,5 +1,9 @@
 package org.insa.graphs.algorithm.shortestpath;
 
+import org.insa.graphs.algorithm.utils.BinaryHeap;
+import org.insa.graphs.model.Graph;
+import org.insa.graphs.model.Node;
+
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
     public DijkstraAlgorithm(ShortestPathData data) {
@@ -16,6 +20,35 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         // variable that will contain the solution of the shortest path problem
         ShortestPathSolution solution = null;
 
+        Graph graph = data.getGraph();
+        final int nbNodes = graph.size();
+
+       
+       //Remplir le tableau
+        Label[] labels=new Label[nbNodes];
+        for (Node node:graph.getNodes()){
+            labels[node.getId()]=new Label(node);
+
+
+
+
+            BinaryHeap<Label> tas=new BinaryHeap<>();
+        }
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
+       
         // TODO: implement the Dijkstra algorithm
 
         // when the algorithm terminates, return the solution that has been found
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
index e69de29..72a825e 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
@@ -0,0 +1,56 @@
+package org.insa.graphs.algorithm.shortestpath;
+
+import org.insa.graphs.model.Arc;
+import org.insa.graphs.model.Node;
+
+
+
+public class Label implements Comparable<Label>{
+
+
+    private Node sommetCourant;
+    private boolean marque;
+    private double coutRealise;
+    private Arc pere;
+
+    public Label(Node sommetCourant) {
+        this.sommetCourant=sommetCourant;
+        this.marque=false;
+        this.coutRealise=0;
+        this.pere=null;
+
+}
+
+public Node getSommetCourant(){
+    return this.sommetCourant;
+
+}
+public boolean isMarque(){
+    return this.marque;
+    }
+public double getCoutRealise(){
+    return this.coutRealise;
+}
+public Arc getPere(){
+    return this.pere;
+}
+public void setMarque(){
+    this.marque=true;
+}
+public void setCoutRealise(double coutRealise){
+    this.coutRealise=coutRealise;
+
+}
+public void setPere(Arc pere){
+    this.pere=pere;
+}
+public double getCost(){
+    return this.coutRealise;
+}
+
+@Override
+public int compareTo(Label other){
+return Double.compare(this.getCost(), other.getCost());
+
+}
+}
\ No newline at end of file
diff --git a/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java b/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java
index f4d345d..12c8569 100644
--- a/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java
+++ b/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java
@@ -233,19 +233,17 @@ public class Path {
      * @deprecated Need to be implemented.
      */
  public boolean isValid() {
-    // Cas 1 : chemin vide
+
     if (this.isEmpty()) {
         return true;
     }
-    // Cas 2 : nœud unique, pas d'arcs
+
     if (this.arcs.isEmpty()) {
         return true;
     }
-    // Cas 3 : le premier arc doit partir de l'origine
-    if (!this.arcs.get(0).getOrigin().equals(this.origin)) {
+   if (!this.arcs.get(0).getOrigin().equals(this.origin)) {
         return false;
     }
-    // Cas 4 : chaque arc doit enchaîner sur le suivant
     for (int i = 0; i < this.arcs.size() - 1; i++) {
         if (!this.arcs.get(i).getDestination().equals(this.arcs.get(i + 1).getOrigin())) {
             return false;