1) preorder traversal
先根遍历
1.
This paper presents the recursive algorithm of looking for open traverse net calculation path by preorder traversal method based on open traverse net topological relation.
本文从支导线网的拓扑关系出发,结合数据结构"树"的概念,采用先根遍历递归方式介绍了寻找支导线网的计算路径算法,并采用Vis-ual C++编程语言加以阐述与实现。
2.
As to the problem of mutual mapping between the model of Tree Topology Concept and the model of Tree View Control in the Visual program environment,an universal method of encoding named as“Line Scan Encoding”is designed,which is based on Preorder Traversal and Layer Record,to meet the different need for mutual conversion operation between the two kind of model.
针对树型拓扑结构的概念模型与开发环境中的树控件模型之间的相互映射问题,设计了一种基于先根遍历、层次记录的“行扫描编码”通用方法,满足不同的开发者对于概念树模型与控件树模型之间的互操作需求。
2) prefix traversal of expression tree
树的先根遍历
3) preorder traversal
先序遍历
1.
And then an algorithm based on preorder traversal of the forest is designed for find all the stable matching results.
本文首先对稳定婚姻匹配问题进行了简单的阐述,并介绍了 Gale-Shapley 算法的基本思想及其性质,然后为找到所有的稳定匹配结果而设计了基于先序遍历森林的算法,并由 Gale-shapley 算法的性质得到一个定律及其推论,利用推论对算法做了进一步改进,大大减少了时间复杂度。
4) depth first searching method
先深遍历
1.
It also uses vector graph as a example to introduce the depth first searching method and simple display of the vector graph, as well as how to use C language to program practically.
并以有向图为例 ,介绍了有向图的先深遍历和简单显示 ,以及如何用C程序语言对其进行的实际编程。
5) postorder-traversal
后根遍历
6) Breadth first search
广度优先遍历
1.
Based on the breadth first search,the paper proposed a new sufficient condition of Bigraph which is easy to be implemented.
利用图的广度优先遍历,提出了一个易于实现的二部图判定的充要条件:无向图G是二部图当且仅当G的广度优先生成森林中的同一层上的任意两点在G中不邻接。
补充资料：先不先
1.方言。犹言首先。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条