pgm09_07.txt
来自「Data Structures And Algorithms With Obje」· 文本 代码 · 共 27 行
TXT
27 行
## This file contains the Python code from Program 9.7 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/pgm09_07.txt#class Tree(Container): def breadthFirstTraversal(self, visitor): assert isinstance(visitor, Visitor) queue = QueueAsLinkedList() if not self.isEmpty: queue.enqueue(self) while not queue.isEmpty and not visitor.isDone: head = queue.dequeue() visitor.visit(head.key) for i in xrange(head.degree): child = head.getSubtree(i) if not child.isEmpty: queue.enqueue(child) # ...
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?