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 2bd51bd..f8ca147 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
@@ -12,6 +12,8 @@ import org.insa.graphs.model.Path;
 
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
+    private float pathCost;
+
     public DijkstraAlgorithm(ShortestPathData data) {
         super(data);
     }
@@ -32,6 +34,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
         // List of sommets, but with type Label
         ArrayList<Label> labels = new ArrayList<Label>(nbNodes);
+
         // Heap of sommets
         BinaryHeap<Label> tas = new BinaryHeap<Label>();
 
@@ -97,6 +100,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         }
 
     if (labels.get(data.getDestination().getId()).getParentNode() == null) {
+        this.pathCost = 0;
         solution = new ShortestPathSolution(data, Status.INFEASIBLE);
     }
     else {
@@ -128,15 +132,18 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
         notifyDestinationReached(data.getDestination());
 
-
-
         // Reverse the path...
         Collections.reverse(arcs_path);
 
         // Create the final solution.
         solution = new ShortestPathSolution(data, Status.OPTIMAL, new Path(graph, arcs_path));
+
+        this.pathCost = labels.get(data.getDestination().getId()).getTotalCost();
     }
-    
     return solution;
     }
+
+    public float getCostPath() {
+        return this.pathCost;
+    }
 }