From a0bcb973410ce64a0a905767001e8cec9a6d1f73 Mon Sep 17 00:00:00 2001
From: brunetto <brunetto@insa-toulouse.fr>
Date: Wed, 29 Mar 2023 18:17:04 +0200
Subject: [PATCH] =?UTF-8?q?Djikstra=20=C3=A0=20tester?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../shortestpath/DijkstraAlgorithm.java       | 82 ++++++++++++++++++-
 1 file changed, 80 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..4c7f586 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,80 @@ 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;
+
+
+        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())
+            {
+                currentLabel = labelSommets.get(arc.getDestination().getId());
+                if(!currentLabel.getMarque())
+                {
+                    currentCost = currentLabel.getCost();
+                    newCost = arc.getLength();
+                    if(newCost < currentCost || currentCost == -1.0)
+                    {
+                        currentLabel.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);
+        }
+
     }
 
+
 }