beug

be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java

@@ -45,9 +45,9 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
                         if(!l.marque){
                             double cout = l.getCost();
                             System.out.println("c = " + cout);
-                            l.cost = Math.min(l.getCost(), x.getCost()+suivant.getLength());
+                            l.setCost(Math.min(l.getCost(), x.getCost()+suivant.getLength()));
                             System.out.println("l = " + l.getCost());
-                            System.out.println("x = " + x.cost);
+                            System.out.println("x = " + x.getCost());
                             if(cout != l.getCost()){
                                 if (arcs.size() < i ){
                                     System.out.println("arc");