| 1. | Therefore , we can implement the depth - first traversal in the
因此，我们可以在抽象 |
| 2. | Depth - first visitors and broken dispatches
深度优先访问器和中断的分派 |
| 3. | With depth - first visitors , this is especially easy to do
通过深度优先访问器，特别容易发生这种情况。 |
| 4. | Diagnosing java code : depth - first visitors and broken dispatches
诊断java代码:深度优先访问器和中断的分派 |
| 5. | The search is depth - first
该搜索为深度优先。 |
| 6. | Depth - first visitors ,
深度优先访问器 |
| 7. | Note that it is possible to select other algorithms besides a depth - first walk
注意，也可以选择深度优先遍历之外的其他算法。 |
| 8. | Depth - first search
深度优先搜索 |
| 9. | Also , the implementor of a depth - first visitor would have handy in the signatures of the
另外，对于每种类型，深度优先访问器的实现将有一个容易获得（在 |
| 10. | So there you have it : depth - first visitors , why they re cool , and how they can bite you
因此，您就知道了为什么深度优先访问器很酷以及它们会怎样刺痛您。 |
