minheap

package

v1.14.4 Latest Latest Go to latest Published: Feb 24, 2022 License: MIT Imports: 1 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type MinHeap []*PQItem

Priority queue is based on a regular array

func (h MinHeap) Len() int

Len returns the length of a priority queue

func (h MinHeap) Less(i, j int) bool

Less defines the order between two priority queue entries

func (h *MinHeap) Peek() interface{}

Peek returns the top element (min priority)

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

Pop pulls the top (max priority) element from a priority queue. Complexity: O(1)

func (h *MinHeap) Push(x interface{})

Push inserts an element to a priority queue. Complexity: O(logN)

func (h MinHeap) Swap(i, j int)

Swap is used for swapping two priority queue elements on sorting

func (h *MinHeap) Update(item *PQItem, value interface{}, priority int64)

Update allows to change a priority queue item's value and priority. Complexity: O(logN)

type PQItem struct {
	Value    interface{}
	Priority int64
	Index    int
}

PQItem defines a node for a priority queue