Documentation
¶
Index ¶
- type IndexMinPriorityQueue
- func (pq *IndexMinPriorityQueue) ChangeWeight(i int, weight Weight)
- func (pq *IndexMinPriorityQueue) Contains(i int) bool
- func (pq *IndexMinPriorityQueue) DecreaseWeight(i int, weight Weight)
- func (pq *IndexMinPriorityQueue) DelMin() (int, error)
- func (pq *IndexMinPriorityQueue) Delete(i int)
- func (pq *IndexMinPriorityQueue) Empty() bool
- func (pq *IndexMinPriorityQueue) IncreaseWeight(i int, weight Weight)
- func (pq *IndexMinPriorityQueue) Insert(i int, weight Weight)
- func (pq *IndexMinPriorityQueue) MinIndex() int
- func (pq *IndexMinPriorityQueue) MinWeight() Weight
- func (pq *IndexMinPriorityQueue) Size() int
- func (pq *IndexMinPriorityQueue) WeightOf(i int) Weight
- type MinPriorityQueue
- type Weight
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type IndexMinPriorityQueue ¶
type IndexMinPriorityQueue struct {
// contains filtered or unexported fields
}
IndexMinPriorityQueue is an indexed minimum priority queue using an indexed binary heap as underlying data structure
func NewIndexMinPriorityQueue ¶
func NewIndexMinPriorityQueue(maxSize int) *IndexMinPriorityQueue
func (*IndexMinPriorityQueue) ChangeWeight ¶
func (pq *IndexMinPriorityQueue) ChangeWeight(i int, weight Weight)
func (*IndexMinPriorityQueue) Contains ¶
func (pq *IndexMinPriorityQueue) Contains(i int) bool
func (*IndexMinPriorityQueue) DecreaseWeight ¶
func (pq *IndexMinPriorityQueue) DecreaseWeight(i int, weight Weight)
func (*IndexMinPriorityQueue) DelMin ¶
func (pq *IndexMinPriorityQueue) DelMin() (int, error)
func (*IndexMinPriorityQueue) Delete ¶
func (pq *IndexMinPriorityQueue) Delete(i int)
func (*IndexMinPriorityQueue) Empty ¶
func (pq *IndexMinPriorityQueue) Empty() bool
func (*IndexMinPriorityQueue) IncreaseWeight ¶
func (pq *IndexMinPriorityQueue) IncreaseWeight(i int, weight Weight)
func (*IndexMinPriorityQueue) Insert ¶
func (pq *IndexMinPriorityQueue) Insert(i int, weight Weight)
func (*IndexMinPriorityQueue) MinIndex ¶
func (pq *IndexMinPriorityQueue) MinIndex() int
func (*IndexMinPriorityQueue) MinWeight ¶
func (pq *IndexMinPriorityQueue) MinWeight() Weight
func (*IndexMinPriorityQueue) Size ¶
func (pq *IndexMinPriorityQueue) Size() int
func (*IndexMinPriorityQueue) WeightOf ¶
func (pq *IndexMinPriorityQueue) WeightOf(i int) Weight
type MinPriorityQueue ¶
type MinPriorityQueue struct {
// contains filtered or unexported fields
}
MinPriorityQueue is a minimum priority queue using a binary heap as underlying data structure
func NewMinPriorityQueue ¶
func NewMinPriorityQueue() MinPriorityQueue
func (*MinPriorityQueue) Insert ¶
func (pq *MinPriorityQueue) Insert(i edge.Edge)
func (*MinPriorityQueue) IsEmpty ¶
func (pq *MinPriorityQueue) IsEmpty() bool
func (*MinPriorityQueue) Min ¶
func (pq *MinPriorityQueue) Min() edge.Edge
func (*MinPriorityQueue) Size ¶
func (pq *MinPriorityQueue) Size() int
Source Files
Click to show internal directories.
Click to hide internal directories.