Documentation
¶
Index ¶
- type LinkedList
- type Node
- type PriorityQueue
- func (t *PriorityQueue[Key, Priority]) Empty() bool
- func (t *PriorityQueue[Key, Priority]) Peek() Key
- func (t *PriorityQueue[Key, Priority]) Pop() Key
- func (t *PriorityQueue[Key, Priority]) Pretty() string
- func (t *PriorityQueue[Key, Priority]) Push(key Key, priority Priority)
- func (t *PriorityQueue[Key, Priority]) Update(key Key, priority Priority)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LinkedList ¶
type LinkedList[T comparable] struct { // contains filtered or unexported fields }
type Node ¶
type Node[Key comparable, Priority cmp.Ordered] struct { // contains filtered or unexported fields }
type PriorityQueue ¶
type PriorityQueue[Key comparable, Priority cmp.Ordered] struct { // contains filtered or unexported fields }
func New ¶
func New[Key comparable, Priority cmp.Ordered]() *PriorityQueue[Key, Priority]
func (*PriorityQueue[Key, Priority]) Empty ¶
func (t *PriorityQueue[Key, Priority]) Empty() bool
func (*PriorityQueue[Key, Priority]) Peek ¶
func (t *PriorityQueue[Key, Priority]) Peek() Key
func (*PriorityQueue[Key, Priority]) Pop ¶
func (t *PriorityQueue[Key, Priority]) Pop() Key
func (*PriorityQueue[Key, Priority]) Pretty ¶
func (t *PriorityQueue[Key, Priority]) Pretty() string
func (*PriorityQueue[Key, Priority]) Push ¶
func (t *PriorityQueue[Key, Priority]) Push(key Key, priority Priority)
func (*PriorityQueue[Key, Priority]) Update ¶
func (t *PriorityQueue[Key, Priority]) Update(key Key, priority Priority)
Source Files
Click to show internal directories.
Click to hide internal directories.