本文整理汇总了Python中queue.Queue.isempty方法的典型用法代码示例。如果您正苦于以下问题：Python Queue.isempty方法的具体用法？Python Queue.isempty怎么用？Python Queue.isempty使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类queue.Queue的用法示例。
在下文中一共展示了Queue.isempty方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: bfsreduceall
# 需要导入模块: from queue import Queue [as 别名]
# 或者: from queue.Queue import isempty [as 别名]
def bfsreduceall(sudokuObject):
source = sudokuObject.solutiondriverNoGuess()
if source == "Bad Response":
return None
elif type(source) is Sudoku:
return source
Q = Queue([sudokuObject])
loop = 1
startminnodes = None
while not Q.isempty():
# print("loop no",loop)
if loop > 2: return dfsreduceall(sudokuObject)
# if startminnodes is not None:
# for node in startminnodes:print(node.allowedset,node.id)
# print("Q.unqueue()",Q)
v = Q.unqueue()
unfnodes = v.getOrderedMinnodesUnfilled() # unfinished nodes
if loop == 1: startminnodes = unfnodes
for minnode in unfnodes:
for permutedvalue in minnode.allowedset:
global numsudokuobjects
numsudokuobjects += 1
newsudokuObject = sudokuObject.__deepcopy__()
newsudokuObject.nodes[minnode.id].setValue(permutedvalue)
postsolveobject = newsudokuObject.solutiondriverNoGuess()
if type(postsolveobject) is Sudoku:
return postsolveobject
elif postsolveobject != "Bad Response":
Q.enqueue(newsudokuObject)
loop += 1
return None示例2: BFS
# 需要导入模块: from queue import Queue [as 别名]
# 或者: from queue.Queue import isempty [as 别名]
def BFS(mygraph,source,group = None):
mygraph.nodes[source].explored = True
mygraph.nodes[source].layer = 0
mygraph.nodes[source].group = group
Q = Queue([source])
while Q.isempty() == False:
v = Q.unqueue()
for secondnode in mygraph.graph_dict[v]:
if mygraph.nodes[secondnode].explored == False:
mygraph.nodes[secondnode].explored = True
mygraph.nodes[secondnode].layer = mygraph.nodes[v].layer + 1
mygraph.nodes[secondnode].group = group
Q.enqueue(secondnode)
return mygraph示例3: range
# 需要导入模块: from queue import Queue [as 别名]
# 或者: from queue.Queue import isempty [as 别名]
for _ in range(10):
buckets.append(Queue())
#print(buckets)
m = 200 #number of numbers
n = 5 #highest number will be 10**n
orignalSeq = []
for _ in range(m):
number = random.randint(0, 10**n-1)
orignalSeq.append(number)
queue.put(number)
print("Vi börjar med ordningen:", orignalSeq)
for i in range(0, n):
#1
while not queue.isempty():
x = queue.get()
#print("queue.get ger", x)
y = int(x / 10**i)
k = y % 10
buckets[k].put(x)
#2
for bucket in buckets:
while not bucket.isempty():
x = bucket.get()
queue.put(x)
finalSeq = []
while not queue.isempty():
finalSeq.append(queue.get())示例4: ord
# 需要导入模块: from queue import Queue [as 别名]
# 或者: from queue.Queue import isempty [as 别名]
if svenska.exists(child) and not gamla.exists(child):
nod2=Node(child, nod) #skapar vi en ny nod med child som ord(value) och pekar(parent) på nod
gamla.put(child) #stoppar in de besökta child i binärträdet gamla
q.put(nod2) #stoppar in nod2 i kön
def countchain(nod2):
if nod2.parent==None:
return 0
else:
return 1+countchain(nod2.parent)
def writechain(nod2):
if nod2.parent==None:
print(nod2.value)
return
writechain(nod2.parent)
print(nod2.value)
q.put(Node(startord,None)) #stoppar in startord i kön
while not q.isempty(): #så länge kön inte är tom...
word=q.get() #Lagrar q.get() som en variabel
makesons(word) #Kör makesons på alla ord man stoppar in i kön, dvs sönerna till starordet och sönernas söner osv. Tills man ej hittar några söner längre. Det sista ordet som man då tog ut i kön är det ordet som ger den längsta vägen till gud.
writechain(word) #När kön är tom så skriver man ut längsta kedjan till/från gud.
print("Kedjans längd:", countchain(word)) #Skriver ut längsta kedjans längd.