go利用最小堆实现优先队列

实现代码 package core import "container/heap" type Item struct { Value interface{} Index int Priority int } type PriorityQueue []*Item func NewPriorityQueue(cap int) PriorityQueue {

>>阅读原文<<