| 程序包 | 说明 |
|---|---|
| cn.ponfee.disjob.common.tree |
| 限定符和类型 | 方法和说明 |
|---|---|
List<FlatNode<T,A>> |
TreeNode.flatBFS()
广度优先遍历BFS(Breath-First Search)
|
List<FlatNode<T,A>> |
TreeNode.flatCFS()
按层级方式展开节点:兄弟节点相邻
子节点优先搜索CFS(Children-First Search)
Should be invoking after
TreeNode.mount(List, boolean, boolean, Comparator)
Note:为了构建复杂表头,保证左侧的叶子节点必须排在右侧叶子节点前面,此处不能用广度优先搜索策略
|
List<FlatNode<T,A>> |
TreeNode.flatDFS()
深度优先搜索DFS(Depth-First Search):使用前序遍历
Should be invoking after
TreeNode.mount(List, boolean, boolean, Comparator) |
| 限定符和类型 | 方法和说明 |
|---|---|
<R> R |
FlatNode.convert(Function<FlatNode<T,A>,R> convertor) |
Copyright © 2025. All rights reserved.