Edge cases to fix

be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java

@@ -138,6 +138,16 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
     @Override
     public void remove(E x) throws ElementNotFoundException {
         // TODO:
+        if (isEmpty() || !array.contains(x)) {
+            throw new ElementNotFoundException(x);
+        }
+        int indice_suppression = array.indexOf(x);
+        arraySet(indice_suppression, array.get(this.currentSize - 1));
+        //array.remove(this.currentSize);
+        this.currentSize--;
+        if (indice_suppression < this.currentSize) {
+            percolateDown(indice_suppression);
+        }
     }
 
     @Override