MCPcopy Create free account
hub / github.com/arnauddri/algorithms / NewMin

Function NewMin

data-structures/priority-queue/priority_queue.go:34–38  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

32}
33
34func NewMin() (q *PQ) {
35 return &PQ{
36 data: *heap.NewMin(),
37 }
38}
39
40func (pq *PQ) Len() int {
41 return pq.data.Len()

Callers 1

TestMinPriorityQueueFunction · 0.70

Calls

no outgoing calls

Tested by 1

TestMinPriorityQueueFunction · 0.56