python队列queue 之优先级队列

import queue as Q

def PriorityQueue_int():
    que = Q.PriorityQueue()
    que.put(10)
    que.put(1)
    que.put(5)
    while not que.empty():
        print (que.get())
PriorityQueue_int()
'''最先弹出1，然后5，最后10'''

import queue as Q

class Skill(object):
    def __init__(self,priority,description):
        self.priority = priority
        self.description = description
    
    def __lt__(self,other): 
        return self.priority < other.priority
                   
    def __str__(self):
        return '(' + str(self.priority)+',\'' + self.description + '\')'

def PriorityQueue_class():
    que = Q.PriorityQueue()
    que.put(Skill(7,'proficient7'))
    que.put(Skill(5,'proficient5'))
    que.put(Skill(6,'proficient6'))
    que.put(Skill(10,'expert'))
    que.put(Skill(1,'novice'))
    print ('end')
    while not que.empty():
        print (que.get())
    
    
PriorityQueue_class()

'''
当队列的元素是自定义时，需要我们在元素的类中定义出比较规则
''' 

 

转载于:https://www.cnblogs.com/saolv/p/9502124.html