e value of the item; arbitrary.</span>
    priority int    <span class="com">// The priority of the item in the queue.</span>
    <span class="com">// The index is needed by update and is maintained by the heap.Interface methods.</span>
    index int <span class="com">// The index of the item in the heap.</span>
}
<span class="com">// A PriorityQueue implements heap.Interface and holds Items.</span>
type PriorityQueue []*Item
func (pq PriorityQueue) Len() int { return len(pq) }
func (pq PriorityQueue) Less(