algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Refactor MinHeap.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-04-03 18:17:14 +03:00
parent 062f5a4929
commit 138c3d9905
5 changed files with 68 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/data-structures/heap/MinHeap.js
View File

@@ -85,7 +85,7 @@ export default class MinHeap {
while (
MinHeap.hasParent(currentIndex) &&
MinHeap.lessThen(this.heapContainer[currentIndex], this.parent(currentIndex))
this.lessThen(this.heapContainer[currentIndex], this.parent(currentIndex))
) {
this.swap(currentIndex, MinHeap.getParentIndex(currentIndex));
currentIndex = MinHeap.getParentIndex(currentIndex);
@@ -101,14 +101,14 @@ export default class MinHeap {
while (this.hasLeftChild(currentIndex)) {
if (
this.hasRightChild(currentIndex) &&
MinHeap.lessThen(this.rightChild(currentIndex), this.leftChild(currentIndex))
this.lessThen(this.rightChild(currentIndex), this.leftChild(currentIndex))
) {
nextIndex = MinHeap.getRightChildIndex(currentIndex);
} else {
nextIndex = MinHeap.getLeftChildIndex(currentIndex);
}
if (MinHeap.lessThen(this.heapContainer[currentIndex], this.heapContainer[nextIndex])) {
if (this.lessThen(this.heapContainer[currentIndex], this.heapContainer[nextIndex])) {
break;
}
@@ -121,7 +121,7 @@ export default class MinHeap {
return this.heapContainer.toString();
}
static compare(a, b) {
compare(a, b) {
if (a === b) {
return 0;
}
@@ -129,7 +129,7 @@ export default class MinHeap {
return a < b ? -1 : 1;
}
static lessThen(a, b) {
return MinHeap.compare(a, b) === -1;
lessThen(a, b) {
return this.compare(a, b) === -1;
}
}