lacau/BE_Graphes
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Edge cases to fix

Browse source
This commit is contained in:
Clement Lacau 2024-04-05 00:55:52 +02:00
parent 2e20b9b3a6
commit c68a969b91
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -141,13 +141,13 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
if (isEmpty() || !array.contains(x)) { if (isEmpty() || !array.contains(x)) {
throw new ElementNotFoundException(x); throw new ElementNotFoundException(x);
} }
int pere = 1;
int indice_suppression = array.indexOf(x); int indice_suppression = array.indexOf(x);
array.remove(indice_suppression); arraySet(indice_suppression, array.get(this.currentSize - 1));
arraySet(indice_suppression, array.get(this.currentSize)); //array.remove(this.currentSize);
array.remove(this.currentSize);
percolateUp(indice_suppression);
this.currentSize--; this.currentSize--;
if (indice_suppression < this.currentSize) {
percolateDown(indice_suppression);
}
} }
@Override @Override