pgm11_20.txt
来自「Data Structures And Algorithms With Obje」· 文本 代码 · 共 27 行
TXT
27 行
## This file contains the Python code from Program 11.20 of# "Data Structures and Algorithms# with Object-Oriented Design Patterns in Python"# by Bruno R. Preiss.## Copyright (c) 2003 by Bruno R. Preiss, P.Eng. All rights reserved.## http://www.brpreiss.com/books/opus7/programs/pgm11_20.txt#class BinomialQueue(MergeablePriorityQueue): def dequeueMin(self): if self._count == 0: raise ContainerEmpty minTree = self.minTree self.removeTree(minTree) queue = BinomialQueue() while minTree.degree > 0: child = minTree.getSubtree(0) minTree.detachSubtree(child) queue.addTree(child) self.merge(queue) return minTree.key # ...
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?