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 18a540f..198cd5d 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
@@ -18,6 +18,8 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
         // TODO: implement the Dijkstra algorithm
 
+        
+
         // when the algorithm terminates, return the solution that has been found
         return solution;
     }
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java
index 90fee1f..533f416 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java
@@ -149,10 +149,6 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
             this.arraySet(xIndex, last);
             this.currentSize--;
 
-            int PIndex = indexParent(xIndex);
-
-            E Parent = this.array.get(PIndex);
-
             
 
             this.percolateUp(xIndex);  // les comparaisons sont déjà gérées dans les percolates et sont récursif