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

feat(binheap): remove passes tests

Browse source
This commit is contained in:
Paul Alnet 2024-04-05 10:51:13 +02:00
parent 04c4316e36
commit cce3fcdca8
1 changed files with 5 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -137,16 +137,17 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
@Override @Override
public void remove(E x) throws ElementNotFoundException { public void remove(E x) throws ElementNotFoundException {
// TODO optimize indexOf
int index = array.indexOf(x); int index = array.indexOf(x);
if (isEmpty() || index == -1 || index >= this.currentSize) { if (isEmpty() || index == -1 || index >= this.currentSize) {
throw new ElementNotFoundException(x); throw new ElementNotFoundException(x);
} }
// replace element with last element // replace element with the min
arraySet(index, array.get(--this.currentSize)); arraySet(index, this.findMin());
percolateDown(index); percolateUp(index);
this.deleteMin();
} }
@Override @Override