From 2b4e645c77f28ba85afd0f689b947e7d09d8ca2f Mon Sep 17 00:00:00 2001
From: norgeux <norgeux@insa-toulouse.fr>
Date: Wed, 5 Apr 2023 15:38:56 +0200
Subject: [PATCH 1/2] Dijktra

---
 .../shortestpath/DijkstraAlgorithm.java       | 42 ++++++++++++++++++-
 .../graphs/algorithm/shortestpath/Label.java  |  2 +-
 2 files changed, 42 insertions(+), 2 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 bacb8e3..d045e66 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,10 @@
 package org.insa.graphs.algorithm.shortestpath;
 
+import org.insa.graphs.algorithm.utils.BinaryHeap;
+import java.util.ArrayList ;
+import org.insa.graphs.model.Node;
+import org.insa.graphs.model.Arc;
+
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
     public DijkstraAlgorithm(ShortestPathData data) {
@@ -10,7 +15,42 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
     protected ShortestPathSolution doRun() {
         final ShortestPathData data = getInputData();
         ShortestPathSolution solution = null;
-        // TODO:
+
+
+        int i ;
+
+        /* Taille du graphe */
+        int tailleGraphe = data.getGraph().size() ;
+
+        /* Tableau contenant tous les labels */
+        ArrayList<Label> labelSommets = new ArrayList<Label>() ;
+
+        /* Déclaration du label */
+        Label currentLabel ;
+
+        /* Déclaration du tas */
+        BinaryHeap<Integer> leTas = new BinaryHeap<Integer>() ;
+
+        /* Compte le nombre de sommets marqués */
+        int nbrMarques = 0 ;
+
+        int x ;
+
+        for(i=0;i<tailleGraphe;i++) {
+            /* Initialisation */
+            currentLabel = new Label(data.getGraph().get(i)) ; 
+            labelSommets.set(i, currentLabel) ; //On met notre label dans le tableau dédié
+        }
+
+        leTas.insert(data.getOrigin().)
+
+        while (currentLabel.marque = false) {
+            x = leTas.deleteMin() ;
+            for (Arc arc : data.getGraph().getNodes()) {
+                currentLabel = new Label(node) ;
+            }
+        }
+
         return solution;
     }
 
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 918fd6b..6100295 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
@@ -27,7 +27,7 @@ public class Label {
         this.sommetCourant = sommetCourant ;
         this.marque = false ;
         this.coutRealise = -1.0 ; //infini
-        this.pere = null ;
+        this.pere = null ; //sommet inexistant
     }
 
     /* METHODES */

From 4dce7308a13338a23fdb31bbf73459b99bd1fbee Mon Sep 17 00:00:00 2001
From: norgeux <norgeux@insa-toulouse.fr>
Date: Wed, 5 Apr 2023 15:52:41 +0200
Subject: [PATCH 2/2] merge dijkstra

---
 .../shortestpath/DijkstraAlgorithm.java       | 83 ++++++++++++++++++-
 1 file changed, 81 insertions(+), 2 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 bacb8e3..824c8bf 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,12 @@
 package org.insa.graphs.algorithm.shortestpath;
 
+import java.util.ArrayList;
+import org.insa.graphs.model.Node;
+import org.insa.graphs.model.Arc;
+import org.insa.graphs.model.Path;
+import org.insa.graphs.algorithm.AbstractSolution;
+import org.insa.graphs.algorithm.utils.BinaryHeap;
+
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
     public DijkstraAlgorithm(ShortestPathData data) {
@@ -9,9 +16,81 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
     @Override
     protected ShortestPathSolution doRun() {
         final ShortestPathData data = getInputData();
-        ShortestPathSolution solution = null;
         // TODO:
-        return solution;
+        int tailleGraphe = data.getGraph().size();
+        int nbMarques = 0;
+        int index = 0;
+
+        ArrayList<Label> labelSommets = new ArrayList<Label>();
+        Label currentLabel;
+
+        BinaryHeap<Node> leTas = new BinaryHeap<Node>();
+
+        for(int i = 0; i< tailleGraphe; i++ )
+        {
+            currentLabel = new Label(data.getGraph().get(i));
+            labelSommets.set(i, currentLabel);
+        }
+
+        currentLabel = labelSommets.get(data.getOrigin().getId());
+        currentLabel.setNouveauChemin(null, 0);
+        labelSommets.set(data.getOrigin().getId(), currentLabel);
+        leTas.insert(data.getOrigin());
+
+        Node currentNode;
+        double currentCost;
+        double newCost;
+        Label newLabel;
+
+
+        while (nbMarques != tailleGraphe)
+        {
+            currentNode = leTas.deleteMin();
+            index = currentNode.getId();
+
+            currentLabel = labelSommets.get(currentNode.getId());
+            currentLabel.setMarqueTrue();
+            labelSommets.set(index, currentLabel);
+
+            nbMarques++;
+            
+            for(Arc arc : currentNode.getSuccessors())
+            {
+                newLabel = labelSommets.get(arc.getDestination().getId());
+                if(!newLabel.getMarque())
+                {
+                    currentCost = newLabel.getCost() + currentLabel.getCost();
+                    newCost = arc.getLength();
+                    if(newCost < currentCost || currentCost == -1.0)
+                    {
+                        newLabel.setNouveauChemin(arc, newCost);
+                        leTas.insert(arc.getDestination());
+                        labelSommets.set(arc.getDestination().getId(), currentLabel);
+                    }
+                }
+            }
+            
+        }
+        Node finalNode = data.getDestination();
+        index = 0;
+        ArrayList<Arc> arcListe = new ArrayList<Arc>() ;
+
+        while(!finalNode.equals(data.getOrigin())  || index < tailleGraphe)
+        {
+            arcListe.add(labelSommets.get(finalNode.getId()).pere);
+            finalNode = arcListe.get(arcListe.size()-1).getOrigin();
+            index++;
+        }
+        if(index != tailleGraphe)
+        {
+            return new ShortestPathSolution(data, AbstractSolution.Status.FEASIBLE, new Path(data.getGraph(),arcListe ));
+        }
+        else
+        {
+            return new ShortestPathSolution(data, AbstractSolution.Status.INFEASIBLE);
+        }
+
     }
 
+
 }