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()

‘‘‘
當隊列的元素是自定義時，需要我們在元素的類中定義出比較規則
‘‘‘ 

python隊列queue 之優先級隊列