rank_paring

package

v0.0.0-...-88e3535 Latest Latest Go to latest Published: May 20, 2019 License: MIT Imports: 2 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 RPHeap struct {
	// contains filtered or unexported fields
}

RPHeap is an implementation of a rank Pairing Heap. The zero value for RPHeap Root is an empty Heap.

func New() *RPHeap

New returns an initialized rankPairingHeap.

func (r *RPHeap) Adjust(old, new heap.Item) heap.Item

Adjust the value of an item, since we have to find the item Complexity is O(n)

func (r *RPHeap) Clear()

Clear the whole rankPairingHeap

func (r *RPHeap) Delete(val heap.Item) heap.Item

Delete an item from the heap Complexity is O(n)

func (r *RPHeap) DeleteMin() heap.Item

DeleteMin removes the top most value from the rankPairingHeap and returns it Complexity: O(log n)

func (r *RPHeap) FindMin() heap.Item

FindMin returns the value of root Complexity: O(1)

func (p *RPHeap) Init() *RPHeap

Init initializes or clears the rankPairingHeap

func (r *RPHeap) Insert(val heap.Item) heap.Item

Insert the value val into the heap and return it Complexity: O(1)

func (r *RPHeap) Meld(a heap.Interface) heap.Interface

Merge a rankPairingHeap r0 into a heap r, then clear r0 Complexity: O(1)

func (r *RPHeap) Size() int

Size returns the size of the RPHeap