Implémentation du remove faite

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

@@ -137,7 +137,40 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
 
     @Override
     public void remove(E x) throws ElementNotFoundException {
-        // TODO:
+    	boolean trouve=false;
+    	E element;
+    	for(int i=0;i<this.currentSize;i++)
+    	{
+    		if(trouve)
+    		{
+    			if(i!=this.currentSize-1)
+    			{	element = this.array.get(i);
+    				this.array.set(i,this.array.get(i+1));
+    				this.array.set(i+1,element);
+    			}
+    		}
+    		else
+    		{
+    			if(x==this.array.get(i))
+    			{
+    				trouve=true;
+    				if(i!=this.currentSize-1)
+        			{	element = this.array.get(i);
+        				this.array.set(i,this.array.get(i+1));
+        				this.array.set(i+1,element);
+        			}
+    			}
+    		}
+    	}
+    	if(!trouve) 
+    	{
+    		throw new ElementNotFoundException(x);
+    	}
+    	this.currentSize--;
+    	for(int i=0;i<this.currentSize;i++)
+    	{
+    		this.percolateDown(i);
+    	}
     }
 
     @Override