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 ¶
Examples ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
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
Source Files
Click to show internal directories.
Click to hide internal directories.