1 files changed, 41 insertions, 2 deletions
diff --git a/pkg/priority_queue/binary_heap.go b/pkg/priority_queue/binary_heap.go
index c660ddb6..7e034e82 100644
--- a/pkg/priority_queue/binary_heap.go
+++ b/pkg/priority_queue/binary_heap.go
@@ -4,9 +4,48 @@ binary heap (min-heap) algorithm used as a core for the priority queue
 
 package priorityqueue
 
-type BinHeap struct {
-}
+type BinHeap []PQItem
 
 func NewBinHeap() *BinHeap {
 	return &BinHeap{}
 }
+
+func (bh *BinHeap) Init(items []PQItem) {
+	arraySize := len(items) - 1
+
+	for i := arraySize/2 - 1; i >= 0; i-- {
+		bh.shiftDown(items, i, arraySize)
+	}
+
+	for i := arraySize - 1; i >= 1; i-- {
+		items[0], items[i] = items[i], items[0]
+		bh.shiftDown(items, 0, i-1)
+	}
+}
+
+func (bh *BinHeap) shiftDown(numbers []PQItem, k, n int) {
+	// k << 1 is equal to k*2
+	for k<<1 <= n {
+		j := k << 1
+
+		if j < n && numbers[j].Priority() < numbers[j+1].Priority() {
+			j++
+		}
+
+		if !(numbers[k].Priority() < numbers[j].Priority()) {
+			break
+		}
+
+		numbers[k], numbers[j] = numbers[j], numbers[k]
+		k = j
+	}
+}
+func (bh *BinHeap) fix() {}
+
+func (bh *BinHeap) Push(_ PQItem) {}
+
+func (bh *BinHeap) Pop() PQItem {
+	bh.fix()
+	// get min
+	return nil
+}