From e6be4aabac49933a2a20c2d8230032fd989430b5 Mon Sep 17 00:00:00 2001
From: pfaure <pfaure@etud.insa-toulouse.fr>
Date: Fri, 27 Mar 2020 17:04:41 +0100
Subject: [PATCH] Version Fonctionnelle : Ajout remove dans binary heap

---
 .../graphs/algorithm/utils/BinaryHeap.java    | 19 ++++++++++++++++++-
 1 file changed, 18 insertions(+), 1 deletion(-)

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 2c1a239..bd2b539 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
@@ -137,7 +137,24 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
 
     @Override
     public void remove(E x) throws ElementNotFoundException {
-        // TODO:
+    	int index = 0;
+    	while (index<this.currentSize && !this.array.get(index).equals(x)) {
+    		index++;
+    	}
+	    if (index != this.currentSize) {
+	    	E dernier = this.array.get(this.currentSize - 1);
+	       	this.arraySet(index, dernier);
+	       	this.arraySet(this.currentSize - 1, null);
+	       	this.currentSize--;
+	       	this.percolateDown(index);
+	       	if (dernier.equals(this.array.get(index))) {
+	       		this.percolateUp(index);
+	       	}
+	       	/*for (index = 0; index < this.currentSize; index++) {
+	       	}*/
+	    } else {
+	    	throw new ElementNotFoundException(x);
+	    }
     }
 
     @Override