Documentation ¶
Overview ¶
Package thinheap implements a thin heap. See http://www.cs.tau.ac.il/~haimk/papers/newthin1.pdf for more details.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Node ¶
type Node[T constraints.Ordered] struct { // contains filtered or unexported fields }
type ThinHeap ¶
type ThinHeap[T constraints.Ordered] struct { // contains filtered or unexported fields }
ThinHeap represents a thin heap. Zero value of ThinHeap is empty ThinHeap.
func (*ThinHeap[T]) DeleteMin ¶
func (h *ThinHeap[T]) DeleteMin() T
DeleteMin delete minimal element from heap and return it.
Click to show internal directories.
Click to hide internal directories.