binomial

README

Binomial heap

func Example() {
	b := New[int]()
	b.Push(1)
	b.Push(9)
	b.Push(9)
	b.Push(7)
	b2 := New[int]()
	b2.Push(13)
	b2.Push(11)
	b.Merge(b2)
	for b.Size() > 0 {
		fmt.Print(b.Pop(), ",")
	}

	// Output: 1,7,9,9,11,13,
}

Documentation

Overview

Example

b := New[int]()
b.Push(1)
b.Push(9)
b.Push(9)
b.Push(7)
b2 := New[int]()
b2.Push(13)
b2.Push(11)
b.Merge(b2)
for b.Size() > 0 {
	fmt.Print(b.Pop(), ",")
}

Output:

1,7,9,9,11,13,

Index

• type Binomial
  • func New[O constraints.Ordered]() *Binomial[O]
  • func (b *Binomial[O]) Merge(b2 *Binomial[O])
  • func (b *Binomial[O]) Pop() O
  • func (b *Binomial[O]) Push(p O)
  • func (b *Binomial[O]) Size() int

Examples

• Package

Types

type Binomial

type Binomial[O constraints.Ordered] struct {
	// contains filtered or unexported fields
}

Binomial is a binomial queue

func New

func New[O constraints.Ordered]() *Binomial[O]

New return a binomial queue with default capacity

func (*Binomial[O]) Merge

func (b *Binomial[O]) Merge(b2 *Binomial[O])

Merge bq1 to bq. ErrExceedCap returned when merge would exceed capacity

func (*Binomial[O]) Pop

func (b *Binomial[O]) Pop() O

func (*Binomial[O]) Push

func (b *Binomial[O]) Push(p O)

func (*Binomial[O]) Size

func (b *Binomial[O]) Size() int

Size get the current size of this binomial queue