您要查找的是不是:
- preorder traversal algorithm 先根遍历
- Storing trees is a common problem, with multiple solutions. There are two major approaches: the adjacency list model, and the modified preorder tree traversal algorithm. 存储树是一个平常的问题,有多个解决方案。有两个主要的方法:邻接列表模式和预排序遍历树算法。
- The paper generalizes two methods of reducing binary tree by preorder traversal and inoder traversal or inorder traversal and endorder traversal. 概括出由前序、中序或中序、后序遍历结果还原二叉树的两种方法。
- Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate. 同时根据二叉树的前序遍历结果匹配血管段,有效地提高了匹配的速度和准确度。
- At present, the approach of preorder traversal integrated with post order traversal is widely used.However, this approach has the disadvantage of being costly to maintain. 现在普遍使用的是前序与后序相结合的算法,但该算法更新维护代价大。
- Comparison with existing voxel traversal algorithms shows that the new algorithm is not only free from accumulated error but also is the fastest. 与现有的体素遍历算法进行比较的结果表明,该算法不仅没有累计误差,而且执行速度也是最快的。
- The traversal algorithm of product structure tree is given according to the characteristics of relational database and the foundation is provided for the realization of PDM system. 结合关系型数据库的特点,给出了产品结构树的遍历算法,从而为PDM系统的实现提供了基础。
- algorithm for 0-OFA is tree traversal algorithm. 运算法则为0OFA的是树横越运算法则。
- The modular structure of irregular fragments reconstruction based on contour feature was introduced, and a new traversing algorithm for the sequence of fragments merging was presented. 摘要介绍了基于轮廓特征的非规则碎片复原系统的模块构成,并针对碎片序列拼合模块,利用碎片间的匹配对关系,提出了一种新的碎片拼合序列遍历算法。
- preorder traversal 前序遍历
- preorder traversal sequence 前序遍历
- Electrical power distribution system reliability appraisal breakdown traversal algorithm 配电系统可靠性评估的故障遍历算法
- AN IMPROVED FAULT TRAVERSAL ALGORITHM FOR COMPLEX DISTRIBUTION SYSTEM RELIABILITY EVALUATION 复杂配电网可靠性评估的改进故障遍历法
- Note that "recursive" here doesn't limit the definition to any specific traversal algorithm; 请注意, “递归”在这里并无限的定义或任何特定的遍历算法;
- Act now, preorder details here, thank you! 心动不如马上行动,订购详情请按此,谢谢!
- Preorder will take about 3 weeks. 预购需时3个星期。
- Only those who preorder can get in . 只有那些预先订票的人才可以进去。
- Please done your payment before preorder deadline. 请在截止前付清款项,否则您的订单将被取消。
- TRAVERSAL ALGORITHM BASED ON MULTI-SUBTREES AND ITS APPLICATION ON THE TOPOLOGICAL RELATIONSHIP IN DIGITAL DRAINAGE NETWORK 基于多叉树的遍历算法在数字水系拓扑关系计算中的应用
- The new method makes the preorder and postorder traversal of the binary- tree as easy as linear list. 论述了二叉树后序遍历的递归算法和非递归算法,对递归算法中的工作栈的执行过程做了分析。