GitHunt
VE

vedhavyas/min-binary-heap

Minimum Binary Heap implementation

heap

--
import "github.com/vedhavyas/min-binary-heap"

Usage

type Heap

type Heap struct {
}

Heap represents Minimum Binary Heap

func New

func New() *Heap

New returns a new Minimum Binary Heap data structure

func (*Heap) Len

func (h *Heap) Len() int

Len returns the total size of Heap

func (*Heap) Pop

func (h *Heap) Pop() interface{}

Pop returns the value with lowest priority if multiple values with same priority
exists, will pop one of them

func (*Heap) Push

func (h *Heap) Push(priority int, key interface{})

Push takes a key and its priority and adds to the heap

Languages

Go100.0%

Contributors

The Unlicense
Created June 11, 2017
Updated June 11, 2017