基于多叉树的遍历算法在数字水系拓扑关系计算中的应用

数字水系中各网格或子流域之间的拓扑关系是正确反映洪水演算顺序的重要环节。针对目前流域拓扑关系计算中存在的问题，提出了一种基于多叉树的流域拓扑关系计算方法，该算法将流域中的网格或子流域概化成树形结构的结点图，运用后序遍历递归算法，可快速自动建立反映洪水演算顺序的拓扑结构，解决了复杂流域洪水的演算集成问题，为分布式水文模型的开发研制奠定了坚实的基础，具有较强的实用价值。

TRAVERSAL ALGORITHM BASED ON MULTI-SUBTREES AND ITS APPLICATION ON THE TOPOLOGICAL RELATIONSHIP IN DIGITAL DRAINAGE NETWORK

The topological relationship for grids or sub-watersheds in distributed hydrological model is an important aspect in accurately reflecting flood routing sequence.A traversal algorithm based on multi-subtrees is suggested for topological relationship,which simplifies grids or sub-watersheds of the digital drainage network as a tree-structured nodded graph and uses recursive post-order traversal algorithm to establish topological relationship of grids or sub-watersheds.The method provides a solid foundation for further development of distributed hydrological model and is valuable in practical operation.