new labelstar

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

@@ -60,16 +60,17 @@ public class Label implements Comparable<Label>{
         this.marque = true;
     }
 
-    /* Setter Pour Cout et Perer */
+    /* Setter Pour Cout et Pere */
     public void setNouveauChemin(Arc arcPere, double coutRealise){
         this.pere = arcPere;
         this.coutRealise = coutRealise;
     }
 
     public double getTotalCost() {
-        return this.coutRealise + ; 
+        return this.coutRealise; 
     }
 
+
 /**
      * Compare the ID of this node with the ID of the given node.
      * 

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

@@ -9,8 +9,6 @@ public class LabelStar extends Label {
 
     /* ATTRIBUT */
 
-    private double totalCost ;
-
     private double estimationCostDest ;
 
 
@@ -18,20 +16,18 @@ public class LabelStar extends Label {
 
     public LabelStar(Node sommetCourant, Node Dest) {
         super(sommetCourant) ;
-        this.totalCost = 0.0 ;
         this.estimationCostDest = sommetCourant.getPoint().distanceTo(Dest.getPoint());
     }
 
     /* METHODES */
 
-    public void calculTotalCost() {
-        totalCost = this.getCoutRealise() + this.estimationCostDest  ;
+    public double getEstimation() {
+        return this.estimationCostDest ;
     }
 
     public double getTotalCost() {
-        return this.totalCost ;
+        return this.getCoutRealise() + this.estimationCostDest ;
     }
 
 
-
 }