From c6814121a42df9f88ddee0039113f8d054c2f542 Mon Sep 17 00:00:00 2001
From: Pellerin Tiphaine <tpellerin@insa-21012>
Date: Tue, 12 May 2026 17:43:43 +0200
Subject: [PATCH] =?UTF-8?q?plus=20rien=20ne=20marche,=20on=20a=20chang?=
 =?UTF-8?q?=C3=A9=20l'endroit=20de=20cr=C3=A9ation=20des=20labels?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .Rhistory                                     |   0
 .../shortestpath/AStarAlgorithm.java          |  98 ++++++++++++++++++
 .../shortestpath/BellmanFordAlgorithm.java    |   2 +-
 .../shortestpath/DijkstraAlgorithm.java       |  27 +++--
 .../graphs/algorithm/shortestpath/Label.java  |  17 ++-
 .../algorithm/shortestpath/LabelStar.java     |  24 +++++
 .../shortestpath/AStarAlgorithm.class         | Bin 524 -> 979 bytes
 .../shortestpath/BellmanFordAlgorithm.class   | Bin 4080 -> 4080 bytes
 .../shortestpath/DijkstraAlgorithm.class      | Bin 5139 -> 5406 bytes
 .../graphs/algorithm/shortestpath/Label.class | Bin 1610 -> 1528 bytes
 .../algorithm/shortestpath/LabelStar.class    | Bin 0 -> 1062 bytes
 .../org/insa/graphs/gui/simple/Launch.java    |  27 +++++
 .../org/insa/graphs/gui/simple/Launch$1.class | Bin 1292 -> 1292 bytes
 .../org/insa/graphs/gui/simple/Launch.class   | Bin 2956 -> 4691 bytes
 .../main/java/org/insa/graphs/model/Path.java |   2 -
 .../classes/org/insa/graphs/model/Path.class  | Bin 6443 -> 6437 bytes
 16 files changed, 172 insertions(+), 25 deletions(-)
 create mode 100644 .Rhistory
 create mode 100644 be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/LabelStar.java
 create mode 100644 be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/LabelStar.class

diff --git a/.Rhistory b/.Rhistory
new file mode 100644
index 0000000..e69de29
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
index fd172f0..f15c7a0 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
@@ -1,9 +1,107 @@
 package org.insa.graphs.algorithm.shortestpath;
 
+import java.util.ArrayList;
+import java.util.Collections;
+
+import org.insa.graphs.algorithm.AbstractSolution.Status;
+import org.insa.graphs.algorithm.utils.BinaryHeap;
+import org.insa.graphs.model.Arc;
+import org.insa.graphs.model.Graph;
+import org.insa.graphs.model.Node;
+import org.insa.graphs.model.Path;
+
 public class AStarAlgorithm extends DijkstraAlgorithm {
 
     public AStarAlgorithm(ShortestPathData data) {
         super(data);
     }
 
+     @Override
+    public ShortestPathSolution doRun() {
+
+        System.out.println("on est dans l'algo");
+        // retrieve data from the input problem (getInputData() is inherited from the
+        // parent class ShortestPathAlgorithm)
+        final ShortestPathData data = getInputData();
+        Graph graph = data.getGraph();
+        final int nbNodes = graph.size();
+        // ArrayList<Label> listLabel = new ArrayList<Label>(nbNodes) ; 
+        LabelStar[] listLabel = new LabelStar[nbNodes];
+        BinaryHeap<Label> tas = new BinaryHeap<Label>();
+
+        // variable that will contain the solution of the shortest path problem
+        ShortestPathSolution solution = null;
+
+        // initialisation
+        for(Node nod : graph.getNodes()){
+            LabelStar l = new LabelStar(nod, false, Integer.MAX_VALUE, null, nod.getPoint().distanceTo(data.getDestination().getPoint()));
+            listLabel[nod.getId()] = l ;
+            if (nod.equals(data.getOrigin())){ 
+                tas.insert(l);
+                l.cout = 0 ;
+                notifyOriginProcessed(nod);
+            }
+        }
+
+        LabelStar xl = tas.findMin();
+        // iterations
+        while (!tas.isEmpty() && xl.sommetCourant!= data.getDestination()){
+            xl = tas.findMin();
+            //System.out.println(xl.getCout());
+            Node x = xl.getSommetCourant() ;
+            notifyNodeMarked(x);
+            xl.marque = true ;
+            for(Arc a : x.getSuccessors()){
+                if(data.isAllowed(a)){
+                    Node n = a.getDestination();
+                    if (!listLabel[n.getId()].getMarque()){
+                        final var c  = listLabel[n.getId()].cout ;
+                        final var w  = listLabel[x.getId()].cout + data.getCost(a) ;
+                        if (c<w){
+                            listLabel[n.getId()].cout = c;
+                        }
+                        else{
+                            if(listLabel[n.getId()].cout!=Integer.MAX_VALUE){
+                                tas.remove(listLabel[n.getId()]);
+                            } else {
+                                notifyNodeReached(n);
+                            }
+                            listLabel[n.getId()].cout = w;
+                            tas.insert(listLabel[n.getId()]);
+                            listLabel[n.getId()].pere = a ;
+                        }
+                    }
+                }
+            }
+            tas.remove(xl);
+        }
+        
+        // when the algorithm terminates, return the solution that has been found
+        
+
+        if (listLabel[data.getDestination().getId()].cout == Integer.MAX_VALUE) {
+            solution = new ShortestPathSolution(data, Status.INFEASIBLE);
+        }
+        else {
+            // The destination has been found, notify the observers.
+            notifyDestinationReached(data.getDestination());
+
+            // Create the path from the array of predecessors...
+            ArrayList<Arc> arcs = new ArrayList<>();
+            LabelStar nCourant = listLabel[data.getDestination().getId()];
+            while (nCourant.pere!=null){
+                arcs.add(nCourant.getPere());
+                nCourant = listLabel[nCourant.getPere().getOrigin().getId()];
+            }
+            // Reverse the path...
+            Collections.reverse(arcs);
+
+            // Create the final solution.
+            solution = new ShortestPathSolution(data, Status.OPTIMAL,
+                    new Path(graph, arcs));
+        }
+
+
+        return solution;
+    }
 }
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.java
index 709438e..c97b9ca 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.java
@@ -17,7 +17,7 @@ public class BellmanFordAlgorithm extends ShortestPathAlgorithm {
     }
 
     @Override
-    protected ShortestPathSolution doRun() {
+    public ShortestPathSolution doRun() {
 
         // Retrieve the graph.
         ShortestPathData data = getInputData();
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 b5c3a71..148f74e 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
@@ -3,11 +3,11 @@ package org.insa.graphs.algorithm.shortestpath;
 import java.util.ArrayList;
 import java.util.Collections;
 
+import org.insa.graphs.algorithm.AbstractSolution.Status;
 import org.insa.graphs.algorithm.utils.BinaryHeap;
 import org.insa.graphs.model.Arc;
 import org.insa.graphs.model.Graph;
 import org.insa.graphs.model.Node;
-import org.insa.graphs.algorithm.AbstractSolution.Status;
 import org.insa.graphs.model.Path;
 
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
@@ -16,8 +16,12 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         super(data);
     }
 
+    public Label newLabel(Node s){
+        return new Label(s, false, Integer.MAX_VALUE, null);
+    }
+
     @Override
-    protected ShortestPathSolution doRun() {
+    public ShortestPathSolution doRun() {
 
         System.out.println("on est dans l'algo");
         // retrieve data from the input problem (getInputData() is inherited from the
@@ -27,18 +31,16 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         final int nbNodes = graph.size();
         // ArrayList<Label> listLabel = new ArrayList<Label>(nbNodes) ; 
         Label[] listLabel = new Label[nbNodes];
-        BinaryHeap<Label> tas = new BinaryHeap<Label>();
+        BinaryHeap<Label> tas = new BinaryHeap<>();
 
         // variable that will contain the solution of the shortest path problem
-        ShortestPathSolution solution = null;
+        ShortestPathSolution solution;
 
         // initialisation
         for(Node nod : graph.getNodes()){
-            Label l = new Label(nod, false, Integer.MAX_VALUE, null);
-            listLabel[nod.getId()] = l ;
-            if (nod.getId()==data.getOrigin().getId()){
-                tas.insert(l);
-                l.cout = 0 ;
+            listLabel[nod.getId()] = null ;
+            if (nod.equals(data.getOrigin())){ 
+                tas.insert(new Label(nod, false, 0, null));
                 notifyOriginProcessed(nod);
             }
         }
@@ -47,15 +49,18 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         // iterations
         while (!tas.isEmpty() && xl.sommetCourant!= data.getDestination()){
             xl = tas.findMin();
+            //System.out.println(xl.getCout());
             Node x = xl.getSommetCourant() ;
             notifyNodeMarked(x);
             xl.marque = true ;
             for(Arc a : x.getSuccessors()){
                 if(data.isAllowed(a)){
+                    if(listLabel[a.getDestination().getId()] == null){
+                        listLabel[a.getDestination().getId()] = newLabel(a.getDestination());}
                     Node n = a.getDestination();
                     if (!listLabel[n.getId()].getMarque()){
-                        int c  = listLabel[n.getId()].cout ;
-                        int w  = listLabel[x.getId()].cout + (int)a.getLength() ;
+                        final var c  = listLabel[n.getId()].cout ;
+                        final var w  = listLabel[x.getId()].cout + data.getCost(a) ;
                         if (c<w){
                             listLabel[n.getId()].cout = c;
                         }
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 9b5eaed..8af88ad 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
@@ -7,10 +7,10 @@ public class Label implements Comparable<Label>{
 
     protected Node sommetCourant ;
     protected Boolean marque ;
-    protected int cout ;
+    protected double cout ;
     protected Arc pere ;
 
-    public Label(Node s, Boolean m, int c, Arc p){
+    public Label(Node s, Boolean m, double c, Arc p){
         this.sommetCourant = s;
         this.cout = c;
         this.marque = m;
@@ -25,24 +25,19 @@ public class Label implements Comparable<Label>{
         return this.marque ;
     }
 
-    public int getCout(){
-        return this.cout;
-    }
-
     public Arc getPere(){
         return this.pere ;
     }
 
-    public int getCost(){
-        int cost = this.cout ;
-        return cost ;
+    public double getCost(){
+        return this.cout ;
     }
 
     public int compareTo(Label l){
-        if (this.cout < l.cout){
+        if (this.getCost() < l.getCost()){
             return -1;
         }
-        else if(this.cout>l.cout){
+        else if(this.getCost()>l.getCost()){
             return 1;
         }
         else{
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/LabelStar.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/LabelStar.java
new file mode 100644
index 0000000..5287342
--- /dev/null
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/LabelStar.java
@@ -0,0 +1,24 @@
+package org.insa.graphs.algorithm.shortestpath;
+
+import org.insa.graphs.model.Arc;
+import org.insa.graphs.model.Node;
+
+public class LabelStar extends Label implements Comparable<Label>{
+
+    protected double coutDest ;
+
+    public LabelStar(Node s, Boolean m, double c, Arc p, double cd){
+        super(s,m,c,p);
+        this.coutDest = cd ;
+    }
+
+    public double getCoutDest () {
+        return this.coutDest ; 
+    }
+
+    @Override
+    public double getCost() {
+        return this.coutDest + this.cout ; 
+    }
+    
+}
diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.class
index 1c8a1c2fa050a35f03289ce8db37d3ca36b9dbbf..7bb818f1172c677ada65633423cb6e597336b904 100644
GIT binary patch
delta 438
zcmbV|PfG$p7{;H`wyo7@wd|i2(;?CVy%>QK;h~!+tsv+!uA6P_&dBU2)TLvW4vJr-
zE(Qg4@7j0hV??7yLB}rhKJPs5?_u7#n|L?vx6h{+0Q*=s5h2*^^|l`Nsw8GKM77Nc
z4l>zZw{TMvep`8hmrTqN%wDn%%lnKs^M_IjIfWEK_n1pJ6n@8TP)7tU&u2q|wxp>0
zZV(o!HGOo|a%td&0aMOJkvfcXq4YHGxKhz`DFRwyb=Rj#j73c`sj;(vaTbzTjKjbZ
zK`K-EeRNGpk2g!%6N21uzjV4>50zw&`q|S0K{^f_iT*9gk!XKFb_`o*CHfy^<2s>j
zQ~z55QLO;$8OhV+{38}#br*r9&&iRKLrm-VcuLn9z%J|D<?n<|U55$A_5dsQe_%3#
MBl?zLb>yvm0khL)<p2Nx

delta 54
zcmcc2-oqkr>ff$?3=9mm3_|P-OpFYs6DO)~G!J5&e49y!k#RByvo<Rm11kgjWD90R
KRt5$p20;Lh0t-?A

diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/BellmanFordAlgorithm.class
index 70a6d6382641ff98c4732c76375a82e0c2668215..eee309bfe059717b95f02d0b55bd8b5ff004b543 100644
GIT binary patch
delta 20
ccmew$|3Q93KQ|-e<_X*)ER2qmm-2f908oPlr2qf`

delta 20
ccmew$|3Q93KQ|-G<_X*)EQ~Ibm-2f908q9Ds{jB1

diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.class
index 78bc15741b05cf60654892d10c710203e5c34941..aa80bbea14ad1ddab09b15f65aaaa43c29ffd180 100644
GIT binary patch
literal 5406
zcmcIo3v?7`75@IsV|JGz<iR5g4NzLzBv6)8EU<x;kU*OnLL@ZhC3LbGl7ZcwFgpR#
zs;$&lrE1k$3WASniI1Xyuz|)RRS|8~YPDLiwe{8dwzk&SIW~U(%r3jhvN<`N<Kd9}
zGjs3#@BQw*-~InQ@y4U40W86P6nF#{npS7fh{d&Fr=@jw#e-U;)3gk`D;kV<nU<}`
z?QYHP3N{#9x5aHst4n=WkT0-!l-jLHQ!O-g!Gb{HVk2hQwX{>&bP1LkG+V2wY7@w>
zH#>Ac^59cZfI@+BO-4*_?uoYR)*7unq6?HZnPDx`rdfu3PQJ{yyNtL%XtbMWfl$M}
zJLrYLqS4yOgu)3xz#G$dHfim8M4%}fh$v%=1e^J@rfRgCIM!+ulnKlpC9sZ)9}_T1
z!9;<Qt=bMP7|~*#!DXfy(Y2V0as&jF9a^MEU$sSGV&(d(rYte;I%SA@W6ah&b*r%M
zg~7qWGk_nZm?rZyU7&fya4%xKAqxQ)o;oY+RDxhSFUuk0KqyeqVXp3p3EWUQYB)1<
z)@nw2Y{QJz_;3{}6<jS)oCcw_H*V`u6;-Gf$TNFvfeCIHh8b+JjF{bOTe=pl@nSZM
z(u_@KgH7+yV)5ybt7Yr?F$Z%M1O>_*t3%aPT#I?kLASINVGt84GeDwgBi2bA{1BM0
z;!U_-K<(7+##nccEsIT{=F*~eD%FpL2q{=3uwax$l?j|Qp`r$hS@87fMoBjU(=OtV
zn^H%h#*bPoRd9pAl;L}3h^eT<GWKHJxShS8S6S7lph2K|xJsJbn8QdsxXg%YR_{%^
z*6l|<R>-Qn(a|S_wP;jvGv4gFD~pG<RZ4fAyh#0ElM%OT#$Y8@DQFfb8u~>=3*JI)
z!`3a$HZ9pPnc9uX_q5Q8TNJFJ`Lu=9R~2ozm7&G-T`Z>YDGN?#u4><^hi!J;I)TZ<
zV@>mhA8WBe#YPEHfh>m(naNEmHsdw{AK$F9j822)G&N^7oaT{++Es+nLGISK_h=D9
zGNc5P9#yTEcy3YA3Ff$v^F_DleIT=1>&<AlW=S?qR_s<4+dvMS5HoFKORwuwi)DuO
zcwFa>(?%qVsx}EDS;|B=JETjCH#>;27#wFT6>-o9Ws4E(SSf=oAA)6uJCdPxsMsmd
zDJD9tW;CkX^=6Ny#cbJIy((^(o)){FN^DkY);7JvN6ojXcst&~sH2*-y@%ykmeHa~
zE@fG-#a$}iDa&iD+@dEe!!)h9g1ZUS#gj>vlbL(Biud5X%$yOgi$u(w5}c{Iz;T$7
z2<*l^D&8+cD&l?(q#f42Br+M$y()@PBIEv`iVxvFw<;Ku6TpNaK&3;NfRCv7sDxW>
zcV|SKoDC9$kEwV7ds((&hXX}}^n0I*{rEUjKnLp0IFm85*Ho&<K^32HipbKV<_=DI
zflsOUw1mGT4gYFg3wOEre@4Y;@i4dU)-9qxCC4<7xJdhbDn92_j1gZR?Y4WR_g_%)
zMa*Dk;zKjP5ceqf5=nG;deXcS&pb3`(qC$B_;3Wr6dV<}Hn)|!c6rtcv+~?wb7iZo
z**$R;U%_z!e`E8C<#nx%%bJ!8T$dGJ+L;_?824c$B-!-~nAwGsHjpzKXC7R_&hBhF
zrQ%VUz;ZW%8O4~)qk^xd2B1T<b(W>|O1AZ504rpjeoe(0Jnq&~i<9VzoZRK6dH~;0
z@l8oxd0Gb<a5pyjaSq>6@NIHVnt1EYNQA7)&LG}T;7RUb={s~Q&SEM{5?Gr3tJ-8j
zzo+8+GBe7mmNktl>zWk&ASWZsGq4{|;c1zG9|_FOPC&+Fs~J9SB!Y+Wj8y)Kz@BX7
z|6}&D67D)GBXUk(1<oBppdyE$JJJbLtUWnTMI)&u!o()ezrhVzsyX6ukGM>xt#Js=
z9zkvRsOO>G8&5Wtz>*O(bC!RqFKH?-X0oI_yI9V1Mr$hNyVxZlcqkK`Mk37rJ4sub
z6_!&qBkvcgUwR%(&LN&AhF)oUyHnSijU)Im9E`;y$PNkL^|_WV%)6Lt*>>F8ki93B
z#*)Fp+g57b&eco7bA;<64VzB(aPA^$3B0D_3S3DBY~?Tx>njX-wVRlAEt?~|nNz7T
z7SpZzh{p2+=jy*kJP;1wj|1E#U0lwM^LS+j^10&ul0Owb)xyJnKw<T)et3^^<>BQ<
zUU1~wVoH`^3|A9fDX19BC(5G;<7k8D2THiMmeZotDj7iOx><QAF@8KQ6aAQagfCsQ
za$8`0hRKo(CQIn#496tlaZTpG3@<l;XTdSdES;6WHPs0Y3oaI{oSndu+KR_e8p<C)
z{kncE4;Ap;O{dVr+pxC}wE^!btQMr$wIL;tA5aolFIoc%wcnb6whtA70_kZ$k**d=
zM-$MirJNyEqXPQ}PX`JT*nWn)D1Bmb`aw$dguK-OZvwjlN<J-|z#a1GPS*i{AI=B-
zNe6a^e6s?+1m3j|XXy!7@1ryG&S6sesXF<3Pph*Cjp3&;QYwKDB=F(=*pqs39QQ9$
z`M}NA&*Ot*`oZv`qH?vo=)nUhO9_^%CvblsR;QjR%Z%*ZM~Q;ey95sO!B;J}`ef=|
zc@gz8MfB8{fbRqzl3_XE%%BW$I3Qs;v>)RF%5i+2@IG?rjb{V-a*^~<?z$gk130{H
z)-im!A16YEeQ2+CMNST2fcbkY<V`Due0`W2@Jc97C-C)K>43XDD@}%c0pD>vbZ+p)
zfcGT6m9+ca0X(&CcEH<@ANJ$Np~66+EWCWDp3mcYt|zmcDp<i&Iee#K5(}<^CC4i;
zmh!gSh-%z|Suil02k=VtVlM8+Jf2gp!+pGn?xl@`Sb#%320o5OoU0)`%gf-Ouo$ml
ziO5H-DB&${CYFk8P$xpXt1RIaZWWe`jaVTz^IoQ-QCPTH+{r`py;vw7K#MrY>+n&u
ziL<;TJ&m>E8Eg>GW0QCZo5ia<?7j|-ZPo56#%-Q*=$;C6d1k`!1o?YDqE0hC!Y*W+
zB%5ihr#ji6rIh?Bz4Ty`XF7g{^JIYv&t&`@&k>ocJSBJ@zd!-^&BF_L5rwpvToIEX
zeo1`fY5q8Vg<o^ER}|tmeCH(sPvW<D7(T|n4=?fE7)E~wUM5Z|G3dnaxGG{4&G<e3
z054-%hCkAZkBGU9;_m-v?(a(dg?9hSZ?9n7Am+oTKqy$K5LX4SC_L!WgH|9kNIvpr
zeN>oL4DxReV=ned;cdmy9%LGGNhsLu$h?6T%ID=>UNFe=$R(Y!SDee4vMc_JX$l7D
z+2ld8ewNP)4m(~K*YWG$k~})oAwi&kWcTWD?i5bCCCz&9cjxEp_y>Q>$#Mk$#J`sY
F{s&|@?6v>^

literal 5139
zcmcInd301)8UNi$CU0i)0wFYk0m9O<WRrnVwn+-j0(3M9fk0}23NMpKGBBB!zIg%C
zifwJxTC7?X+oHCVDzRE+5hl<`#jVu3w(d(S75BQHqkr_&HvaB=GtFcf<ZzBBC-dHY
z_uIeU_kH(1_r_CC1GoYIRNxX=VVIqPNGz@eI!&#oD<06IorW2)y1E1LF2l6+xYeUs
zU4i<@uHA9V)M`@O3bF;NuaLVXDXN*G-jpDaQyqy#tW}g#(r^`$>NQKNDs2_Wt}{Ax
zAF|+8;YN<Y#D+*rZ|d!C*Ue2@dsG)FXfVQBv{f@Ba-IB`ZFNQB0>LX)J|+lN)ZIZV
z1Xf<DjPy|04hXnAjE%i9fz>6YS0kmxi1u0$BUa_bWE3j6Mj(Hewnqy@wOD7Mr7v#j
z-71POMIg)QwFC+q?CppVXf`7;tHm;Pt-HztKf`3iW;5lpJG5AQc65ORgAdbDtYC(~
z<Z;+k%)~4KrAJDN(uu+nN4lfj;^$80$OnNrDz3$K0&1sjg<?IumULgB>gv3<W9P#>
zEKo3CVEI+zM@0!r1w6EAoh$%>S>xE#O?*WIHbIpS<#>yN3W4dPb*7Q2Scm}85s%zP
z^ktQlh7>Fos2I(Xq1+m@c0H<Ki9lIq4rV<X57b6tn%Q@guJ!m(iKVgvmf0E^^m43F
zu@XVY!6te^xEIhtJCl+>&=84RRk^6fDg`$POc=SNVl{3gcf`_7%`!}Zq7mGo<abJ_
zMZJPLiXWDc+EuXzYZ;7~zK`&`CMCg!$olqOdf2K`aFf8a(Y`tXm3I5^Rx~Jho4_Pn
zzRg=}7*Sn|sc1wKF}O#I_Uh|*N*lK%T}&sVj^+{Up_rw2>Sop*LqkJ8EJBNn-6nyi
zvE69ckg7CzC-ql_#+0o?Ut@-C?5{(sikl@K+!Fg861HtBwqUD(mtWSKk<JKfXJ$s|
z$q*2EmAFO4JFuOtlRaBE8BKqBz111rJ(?*y9QAtXlBS{^VTL|zSH1|zLey34L?=r%
zW>}G(eUA2K(+KPFxZWWvAcH@)6{W2**AW%Fu$w{e(&9~aT8Z&3(n9u{7!2<0jKn$`
zrCU=+Bs|SV8T4CKm@*Fej6;jj-K|@7Mz5*GENQ8wqE}j)?^r7JH)`f?y+iu8SH(W`
zF%;dJd227LZ1Om%@nIcqSMg3+19?(KZ&<o%m~jQ~V)VvG91|yVbf=2D@NVWP60eCy
zjlD8BGcyIpPBtU3ANQzuk927Q_0_YRvOr~jmfpTk#l3jHlXZGxn_V~}JSj{`z#mZY
z0U2bq-2r;51h~}jK@}guhaE8udaTo8-(vjN%J_do#Yb&~n0mLdhvWhWReW5Aanf)Y
zH|kor%ZcMdDjvomVx&hm8O7-tk}v&}@;|BKQ+DPf@ipB&R-a78qbd&LF-AC^o<V^b
z8Du5lJP-FM_%uhr=qzODis`d6HTAqWiq9(O7g(HGN=>^wyMzfaXH?E@u{5hUuHp%N
zPQVvxTDzvEB~;t6MqtSplZTDTAckRi98b#T@dW{6EIx(>j5t!Idt*<ttI+IB)?+G;
z%luAt@|%XaWSSM6OpR~5>DQR1)+al^4=1ox0`s(r1O`~O#B8&TgW`<M$U(vhoK^7@
z28leagM~3-@F%;v><IhO=EKuCuiz^r8XgXHMl{OK&%$6HzKX9=x2f;Z&A6=OWK$cS
zP_msJ#Wz%ZQ)WzA-@GZ*Si^yEA>-7LXH6fT!M9{$o)cI!HZf`QI@#9K70RrBM>2m`
z;J{es|6^9i0KqX-dSst>-S$~spg04eb5LQJV(qfhIP<+xCfhz#2n4o{Vawo)%}~Vz
zTN-6lT!u}?E&V7$CQm$BYyvl2hBISHq-s^_j~N7*hzcycQb{S(UHix-_VJ%bO~GL#
zI1R;Kc00`s)2ZZHcw|*b>to3=#M8vct3zK;>iV$lGRBM!NcClCM})vJd=*WoOgp8$
zS+HZ}3?DTlQyx28cz2`LV_$I;yug@^Q^>;!AKlZ~%mn_dA|I338Cy7u!}{8Yyh0U?
zx&ADa)y(k}ip6xZE~@ePz_I%G%N|-s>*M@(nla{3aTc$p;4e=~$l<TT)hf972jrBM
z55RMRZ!Y-w>$AV+lX4Prxh`_3pdybe(qjT9QbxA)#gUbL0UmyZ>)MkjD43eSw6X+d
zH<TwZx3MCDvQ@?Buqc>4h|0DBTpx6cU=BYoKMO`S=;=qJ-*Xl<0_U+Vs0?CJn_tN~
zgHXW+F@TLhuRq(bB(T}<ZLyye`*to5qsZ^}dlT5^_hy~OjxxE~AtiBY9~wI5cP9`%
zPrXV%{yn^qR6RjYnctH@+^=L)&uQ$DtJ@rVeEm4>_a*JwAM}<>9d|s8!}57|FqhWk
zQhj9t?@i#oL%28f;S_c(Q@Nn1&6Qk8`uh*;Se93)7Umtn<P=?@N^ASkoLZB#V8f%_
zcc;E2@IXJjWm3<_Qr`;m$dyjAEw$tKp2maHV%zU^q@jxsNRK~p2owFvDLlfE9Xa~O
z>;7!{k~FVi!(mJw#N%z{C-Ip9d_I`dkM=T$;ERJe!Bl-I=ow}Sdiycc?~z`eO5n`R
zRPVfgSqfy9yr=Nsg`tan&l#Lc%KiEvo@uM_dj|0A0KOf}@#h>Tg0gL#y@cg_FCudM
zMAkGE@IpKV#r&Iz`9y6g=Aw?L#m!u8#{!;yOL%H6#qB7=UEDjstKdP7*oUwfM|gmG
z0!wfV*W(P9;)hs<Us3)gtiZppQV?dMkZ7BMYEjDjSOr##YTm#?L|p@F#YWVN?N}qC
zyifIEskoarqWiE&Jc144I5vuNXc6bpDxO7~cph8Ci#&&3#5VB?ZV|6xt1AmTTpom7
z`RH&><8v0e?Am#f6~d}W)=r+QFj+eVr2HPf&&rzO%Eb>5W^ER`+;|=@Fgo+af9S!F
zSb?SDRs0w~Va?UCUVn<mSh<@~fuG^$@ZzAjAHU$6Lf>D;FS+X>-%)ygh`X0~IDL`d
za_Rj(yhI%;W6*(L^DU2FG~pt-JoKd&zp>?Avh(3e>i;d=Nvhvb?(ezxGA0Z$s9ps^
z!8`@!eEdN{rNW7>Pzqi{Xh>#s90G-z!VpuIJN~A^3xzFXh$c?RNTXmssYpzxFv~qe
zZ2WJ5`I#-6Jm+=HQgDLiO?wsB<=3;R{V~}f=kZA`aI=~HN#fS&kFtM)|FSpA{^`Oi
U_U~WtS3YH%KZ?KMA2<5{3o?tW3jhEB

diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/Label.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/Label.class
index b88539aed2a45d09d72dd26b1989e6eea6eb5a1d..47de11380b6801f7e9693d2ba9d9c535cfb32e76 100644
GIT binary patch
delta 270
zcmXwyO)>*f6otR{UcaO&-CB|=B8^b0MEZ4ige<^MWndXHw+EI$y;2O66?8G6*#Hw0
zBU>=C07F-b!9Dk!`*Y4)^c|kRsL93aRN#I2;ZViOAL~(I2I<6K>itFo#V8^p_aAy}
z3Wh#3cST*s^E3rpz!`>`^u#^Wc3H)OODj4qujsn2^`B;{tUn68U$QO#6>LOWKEb+2
zI`=-YTc^W6s}lmWta|Q=?M&+W2CK_|b#;pkN>j>(VO4MuE4WESpO^s&DJ$gkX1kda
bYpjbBPj-YUc7;nyJl8y+VEmix!`j{t9ri0)

delta 331
zcmYk0%`QVx6ouFM3u$jDiT>S|MnX7ORY{B_lyp#U(U_TZpvDaP0A#;`7~YuFjTd0j
z0W(vtVQAgD5`(k$UOQ)hYk%jb!QHFs-@gqgAK~OwEvVet@Oq?Rwzm6nt`D8P7+#HJ
ztWV@!ADA}w#G0qpJQNmDq%Hxtg@$9T`4=qvD8Y(vBq;lx1XW+P@?{3fO4o`m$MR`A
zGPR+syULBv0LQGFfI0t+@=+MG)o4(2v+)M$n^>hU{eHt5nsknC7Xg<Qcv%L!<TQoV
zQ&`0J0H@<W^9W~SlO`DS(umURbdNkD6wpG2$QnBT;_6u(k(@Ufv(G&XT?mR@v}NLY
EKdiwpssI20

diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/LabelStar.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/LabelStar.class
new file mode 100644
index 0000000000000000000000000000000000000000..a4e37d870c40ffcecd587c5865bc0b05c998d4c6
GIT binary patch
literal 1062
zcmb_b%Wl&^6g`tTcI~=J=mT0>9)$u;s4zn8Tp~dtR#sS~%6{Tnwkz8cjVJsTLINSN
z-~;$5#GNEcqlSVivAE-V@0@d=<Db92{{Zj?&n#3JUJ4m|X;E@7mVBI)9?xPSQ<dai
znFy((QjNJvynv6QY@oQbU@)BAgk`~G*uLN&xtH-G_PQb;bIC_p#IP2MiRw`j2G(OR
zPtzh*9fl9b!POMGIFB-~Pp2PT274z&7V*OGU4wrsL%-J=G8kQAI;dj9g^fBx|9_@v
z4Q((qU07ISXas2y^(Xl#l4r9%Hv<v!Y{+G*?YYxXNm??zS}FZsJMd{*L_Am_F3pG_
zIm6Z;MnyLv$(UjPngDue43+SlVLgsicd?`Daf`NOO?{=(Eg!mgq+2%hA{m^4n8+}C
zpX%k-7mwzJUKoQtNaKR5iKI)llKXF6FR%Ra{hZz`M#sk?m0TsMkr;Ye^ebrFhC}B%
zSqkRV+iX8SY3<d%!ENuFU(xtXcNN^CvrY^U)`p7)Hn2%nhgd)pTiB+r)^>24B5Lgp
zc8RIAJ&LTkP29yk)u6Ql@|lFZhx_viJVI+`t^Ea!Po&J!YLF)AbnXl=Psi|JL4Hkb
dX`G|UBoD)@5q6d$IP(Y<Jf7w`!jtLu>2JV80q_6-

literal 0
HcmV?d00001

diff --git a/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java b/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
index 0e944e7..cac02ef 100644
--- a/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
+++ b/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
@@ -9,6 +9,12 @@ import java.io.FileInputStream;
 import javax.swing.JFrame;
 import javax.swing.SwingUtilities;
 
+import org.insa.graphs.algorithm.ArcInspector;
+import org.insa.graphs.algorithm.ArcInspectorFactory;
+import org.insa.graphs.algorithm.shortestpath.BellmanFordAlgorithm;
+import org.insa.graphs.algorithm.shortestpath.DijkstraAlgorithm;
+import org.insa.graphs.algorithm.shortestpath.ShortestPathData;
+import org.insa.graphs.algorithm.shortestpath.ShortestPathSolution;
 import org.insa.graphs.gui.drawing.Drawing;
 import org.insa.graphs.gui.drawing.components.BasicDrawing;
 import org.insa.graphs.model.Graph;
@@ -43,6 +49,11 @@ public class Launch {
         return basicDrawing;
     }
 
+    private static ShortestPathSolution paths ; 
+    private static ShortestPathSolution paths2 ; 
+    private static DijkstraAlgorithm dijkstra ; 
+    private static BellmanFordAlgorithm bellman ; 
+    private static ShortestPathData data ; 
     public static void main(String[] args) throws Exception {
 
         // visit these directory to see the list of available files on commetud.
@@ -78,6 +89,22 @@ public class Launch {
 
         // TODO: draw the path on the drawing
         drawing.drawPath(path);
+
+        data = new ShortestPathData(graph, path.getOrigin(),path.getDestination(), ArcInspectorFactory.getAllFilters().get(0)) ;
+        dijkstra = new DijkstraAlgorithm(data) ; 
+        bellman = new BellmanFordAlgorithm(data);
+        paths = dijkstra.doRun() ; 
+        paths2 = bellman.doRun() ; 
+        if (paths.getPath().isValid()){
+            System.out.println("c'est valide");
+        }
+        if (paths.getPath().getLength()==path.getLength()) {
+            System.out.println("même longueur ");
+        }
+        if (paths.getPath().getLength()==paths2.getPath().getLength()) {
+            System.out.println("Dijkstra donne le même résultat que Bellman");
+        }
+
     }
 
 }
diff --git a/be-graphes-gui/target/classes/org/insa/graphs/gui/simple/Launch$1.class b/be-graphes-gui/target/classes/org/insa/graphs/gui/simple/Launch$1.class
index f3ce2d88862f3d2285620aa856ddb7327621d2c9..b1eb6cb5f93d8c811645a27dbda8bccf56edc2a6 100644
GIT binary patch
delta 47
zcmeC->fzd8#KNdL*_fq7R)c|yL6bq0L5o3(L7PFIL5IPBL6^aTL65<PL4WcQ77qZx
Ctp|?)

delta 47
zcmeC->fzd8#KI^)*_fq7R*8X&L7736L4`qzL6t$CL5;zHL7l;ZL4(1DL38pE77qZt
CGY44!

diff --git a/be-graphes-gui/target/classes/org/insa/graphs/gui/simple/Launch.class b/be-graphes-gui/target/classes/org/insa/graphs/gui/simple/Launch.class
index a5d653f6225664b3c602f2a5c84fe3dee6823072..8e00c1f89b3e09113849f99ce4cb3723578074c3 100644
GIT binary patch
literal 4691
zcmbVP`+F4C8GcWa-B~sh&`{LnB1;8HC}D)4;)XzzKxiZhlwcrGO((mP&A{x;Ix`!f
zS9%d!s@7|*^lDqN+8ZQoLW~7lT5aw9@_+bq+vh2L&&(#-T-HXj**SC0`R?a?&-d-y
z|9$N$fM)ztL509N$IWV{?de+9)$>E1mMxf?XXf&jp>^s7J3XYJO5mmw`mnB9x}DVy
z44g31zCa|e`$L{UbLU(Ux|MZY(;v!d-jL(^hUZICt*1CS$Vrc56@1gNn*^ePoNWTJ
zjCtau=exQ<YOyl+6j@rPR8pWaU|3d8x8H+ltszId<7P@FRb_Oa*4(#PYf3%bLsseC
zPSZC1T>_PL^}PaBZBE9BqY||$mSUN}vQE=Bx(m4h!#%7IScX7tr<2yLUfnh2ytr89
z51EYh9rG-icU;t2lXeZ=H}<&tDbvmhY^<wakS`MwXhlMD#`m618+my!o`O{Z%V&;#
zdPl(;fyTLKF723-mv(Y_$2M%=(^_@UOc&+Hu^P1sl5}Gs?paB<erp_S@j)4+I|O#r
zy{r9Y^flG@#<2k#72GMXQhIV)^JGM{9{GI0H!agQ4NpZK>KQfD9(GO|Eq3OJZZf}b
zt?Qie{!qcT<#AA^fI3j(mB8Ka%Q)sjPB)pPx6~akQPktRw2f+F&;;7Fob7A$FK76L
zjMix6jAV;#8%DCLqfOf<5o>r2hTkxqwT7p4>3J`J^p>2S&$=;e6*&5S1WBNJnuKTn
zpxd}r-V*&TuYiJKTK(>}EpkUeqrj%Q=b2-cTbk);t){KJX97bH8G6QW72M6x27%?a
z1WAXTFZguZ&~pmz6<9U3*;*JJG+ZMyi{QQz?sn5MN;c!zfhL(TI|Wvh9^Q0J<G2UA
zB*kul+lmylqC`fJGuyE%j%{d_lx+g5XDH{`OX_Ou#Xbe?0_)2Lp~QU^A3+C?p5A5z
z)-C|dFmwS+lN7#RMW?(dB5BL<cy)B+pn?Olpm})6bxz6bRPj+9VkYaEOiv-7cMZ=o
zsAkI5;QF2>4qO#Dtm0POR*ha9RdA#XHm8tXM6!xL91~a~mjg=$lJg;2>PdaCf{zK*
zmyJ=FC^F;1Jc;8tTC33yUBSl}uxdKPW>{1VAk8u&V=Gq$n*NVb^MD&lmCTHNKlaP8
z464Y2!eY|fQ0~EUas$qHzigdh!?pA?o+fDzgp(!(Cj{=D8=OVdQJIi&Sg;l3c*)I`
zFyoI32YDV@*6<IwW>#K2x0lVnZo;=oigi_Zl5Hv3_OOl<&9XSeQNSq$!vYO+HO|=F
z;-))nFV9}VaoctIJfq??&M-eIt;MnkU*B+9)oN)-0D86rmey%{KBNChd|JV$sCxE}
ziqGJ)tfmwpQQlGHEa^-b%+Cqjxj4h(F!2S6^DhdVEqAIR7|SF}5UcmJw{VCE$0ZOr
zr$R-If-kY^m3LuQUp21>isMn7mri{}VCQ_NX7tYzGp~6G4SHNf3`-Pzm2g_5K?`+L
zaXf+Z(!r-y#8E9xd{)JC_!@7vjKlIOuzP`gT!gLDt)!IxbrlgrrLt$`^cyM^IsF#C
zqu|?%_n<TuQ}R`O7ca8AWafppKzaNG*MP*&_f`A=FOkXgdUea>UCcJ{*b=;qR}}nk
zR$JY3#`BGwidXR?QaJ^g-XSVjp$@VsDAvfP7=FSQB)ySvOb$z-EDArvWd)a}io$FL
z6(h1DDtRfxB6cnOT*WUi7TyM(hMkpnB@Jtj;R-v_-1S%4W>}6a^aVE=!)wI(RFWk#
z4*QR!Wh6r~_xdYd!SZ!K`EbEV7Ehi9PIt3J_VNW<8=Attq+8Dgy>5W+0KLU3&5JhA
zn=#yvWMzvZu%-;aLS#~%WMQQ)Ll&F|dvRGA440Qf89D|okQkOA_QOiC@Cj^~$5Pty
z7VDzyprs`t|3XX)lr1vV^!R%EB>T3Y+gI?qf<Mhpj-V@4@E5j6b3qu24D6=*9;e`@
z4cQq9REIy{w#XPWWjc6pZkwgEDd5pmcQb*y4Ee*u!#ZN6lD`Tg#3u2>x3~mOFcSU2
zNYn-+uP2U`<lqk&K5ybo<0v>rHjU%v%Y3Q8az3NM;wpTA?`lYZ6}W}7C9>%tRf6wT
z+*uij*%ycfR!m}b-#BjHKZ&({6uIsS)^EB*(opQuz}EG=mo`w%)@kuETDA!v3dC<l
z!(8!|jZ{lt#51*9I&1Ih5~+wtMJKVXZxY-2y@%f&eYIQ0ks3$yI6gd%mXwlECa_1K
zJE6RZW;wZE5WbD6h+K#l7ZQ<csc0hd78jza$ji7n5lKW};*7%>y10D>J!FYAOyGeE
zP_0NQlQ=$G^IavHA56s(F;YKNfmBr@CUwUqzzam`j>?62aUl`CMk}LIw~~rV-O+?1
zb#suqqt|Ff)dY+R9GQgK*N~_h!%6vg_zL{W34EdgZ{X}WK0k^_Ch=(B2p$>7mq+o~
zB%TN-PmbcL5j-}AXGZb-2%Z|l3!}I&g6GHZ%`trM1yqmVV(pK|@YAWaQ7M1)xeMXW
zc<IgvE(C1TyA#~K%q-Z9?P%lSsW{9Ja1obqjpI4|l^>aMGN*>IhR<dm?oO`kX1eZT
zp6z84v|}U3&FG+<``Nd2vD-L^v*=+pIE)uLUc?c~Jc@VNT>c9Wij{asY(&4<&K9#7
zx@gCMIK&?E7z|-yQ26Zo&chT>^UjnxJV;nDeK3jFr9I+F{1R80y;1QvExk&cwi6O>
z;8(QF6UpM+C9eG%*XiLqtOnuRW~T0M@LPiHv{;2V@fQ8KNc(?>-!rY>ru1`Ic7x%F
zDfokeKk^?W?hgL<LU8;yYFate)ZC!ns%bI>e+F(~zpU9sPPwFj9eBvzKc78XN~^#k
hHSiytNUWhJGWHet8~)BQPH)$8lz;!=S7LYV{{RnnO$q=2

delta 1337
zcmZWpOK)3M5dMzu<JgX`?Kp`Yr)eHEFXw@qCVkx`Z7~UL8mFXfNNXMiH*piUX&h3w
z4X_Aw!v>Jhkt%gjAr`a?Bvgci8!WZ30SO7QV95gU3%UUzvLJl-I`oBg@0oLEzWHX(
z%v}G{_CYNC<3Hcr12BSjBs>DGs@1GjH$2wI{q?FK>P=q&22Ay#xVb$dP;)+eC7WE#
zF3l&$R%dg|#e88&qE=vlevN8bi+TO1flnf)n#>r9s;wyE4o8E)zOM8ZtlpoP@uLw<
z65G|Eo@T8XEh?rd(V;%qj_6$ir_~qQpz6^(^lpJ}^_>+}7xZXTuRzSrAzw(2W{cVJ
zrRB@Tlf{)>_M*hI>Jz<1>{Q?Cjnhf&a-t3h)ODpFWld;)X@1Cw-iO@|Vvj)m7J{6Q
z@wuQL?Divp{SMMrJB?P~Fb+tJ2(-C5EgRwRK^zj$nZlevb5|lw!?ry`RTxGpfahTf
z7_*CoOF2Kra9HAnC(1azuu{01J-e6-;0VUm??y5>5kL^3Doo-<iDRr|mo|mtYTWGC
zPYNWqYT;8i%|P%3_E%vBrzK7a>~Kv#nISEMm(_3Pgf)Yd!}D4IXYjh(E6;p27dRvu
zvJxu-;it<YQB?P=CR5^yK!Zc3O=XMfS1Yv!Xy83ya+REyB&DD<x=ZkW$&Ckou8tX~
zLlxIR1wd)><a6#sRG536mTH&guuDsiGHNm<)J>ET&5*MGF1B^wA+$mpTq6!>f)~vk
zubzkeUUIkM8JB+t+Mee3<QdmT>qewK9qF7Dwjpe@j6|l49=?5ilbJ|+3H>Dumaw;k
zeYT9tbqom{i_7mZ;vAk6Yq*U8+i*1giUx7xzHP>hAE+>G<2I_}M%?_2CyK8zO7mSD
zrHj$Gj<g4iD{NWDi6=vMJ{Ee~_Qt(LzvO|f$GuK)?>b%)jBO1t7BzlXqkayx1V`iM
zea6z)@u~->)b()3n$v-!h;ZG-O7yd4gU%<wuGpx>5IQM)ae&%`xP%l|Igsyi>^{Oc
zKBc^cH12R*9$*T8<G5Spb8cTZ@CLHv)$kY2VwU|g@dxI(^N=ls9L_;oBkB8<EonlS
z#{ygZfHaj|FWQmEc{Y9(*Kh%gOzswwx`-t<wm|y#5ZL4w<CR#Jc#{tZ9&?{z2+9pu
zDGJNlWMKUvOfoVy7ck-c^K7{~I*G~u{Ad2}&pCgDmAFi_d&R3<J<RbfN<Xg}rF4F8
J^L0iy`Y&`w@U8#=

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 d2ad83b..5298eb6 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
@@ -270,7 +270,6 @@ public class Path {
      * Compute the length of this path (in meters).
      *
      * @return Total length of the path (in meters).
-     * @deprecated Need to be implemented.
      */
     public float getLength() {
         float l = 0;
@@ -280,7 +279,6 @@ public class Path {
         // TODO:
         return l;
     }
-
     /**
      * Compute the time required to travel this path if moving at the given speed.
      *
diff --git a/be-graphes-model/target/classes/org/insa/graphs/model/Path.class b/be-graphes-model/target/classes/org/insa/graphs/model/Path.class
index af43bf9ba1a17ff20ba021d5f96a2638bd9f7391..fc4c3b8a841f4343d7e94933324e1f2e07c7fcb0 100644
GIT binary patch
delta 186
zcmZ2&wA5%rF4yELE?IF#1}>M>f}+&q#FEq$E(QmNeLM`i7<O-7$koEb$T(R?+(TQK
zfr(LsL6T9FK><i>GD<MSGB7YGFfap2ZHDCxbAdDygC@fchMkk=i>tE(wFCKkCZ81#
z5>y82Rbh}}RAo>F()x@VlMN&k8Fx$$k}zQ0Gr3v9U(*Dr!jwUp(TqU}Nb4|KAepWQ
NH(iHe$K>A<1^|NGBwzpl

delta 155
zcmZ2#wAyGxE*CeKOKL$;YI0&pYRcqnE_p641_y?HJPf-T_H16r)xyKh#IS<_2qvqE
zdkBg!FfocUNHU5sC;(|qM#;(b;^NFZ8Fo#cDXz{A)WQH%J^8qJkf171r5b|_qdJ2s
ykk)6^nye+E$hdQ|kAwl^j>)wW{(@#e73K`mj1~+^Kw5{<YVutPaiEH?5(WTVmLqil