findkpairswithsmallestsums

package

v0.0.0-...-8653abf Latest Latest Go to latest Published: Sep 19, 2025 License: MIT Imports: 1 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type MinHeap []Set

func (h MinHeap) Empty() bool

Empty function returns true of empty, false otherwise

func (h MinHeap) Len() int

Len function returns the length of MinHeap

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

Less function compares the two elements of MinHeap given their indices

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

Pop function pops the top element of MinHeap

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

Push function pushes the given element into the MinHeap

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

Swap function swaps the values of the elements whose indices are given

func (h MinHeap) Top() interface{}

Top function returns the element at the top of the MinHeap

type Set struct {
	// contains filtered or unexported fields
}