python优先队列heapq

https://blog.csdn.net/weixin_39702559/article/details/110971925

#coding:gbk
import heapq
 
# 使用heapq实现优先队列
#定义一个可比较对象
class CompareAble:
    def __init__(self,priority,jobname):
        self.priority = priority
        self.jobname = jobname
 
    def __cmp__(self, other):
        if self.priority < other.priority:
            return -1
        elif self.priority == other.priority:
            return 0
        else:
            return 1
 
 
joblist = []
 
heapq.heappush(joblist,CompareAble(80,'eat'))
heapq.heappush(joblist,CompareAble(70,'a write plan2'))
heapq.heappush(joblist,CompareAble(70,'write plan'))
heapq.heappush(joblist,CompareAble(90,'sleep'))
heapq.heappush(joblist,CompareAble(100,'write code'))
 
while joblist:
    task = heapq.heappop(joblist)
    print(task.priority,task.jobname)
 

标签：heapq,python,self,heappush,priority,队列,CompareAble,joblist
来源： https://www.cnblogs.com/douzujun/p/16558175.html