您要查找的是不是：
- A Minimum Delay Spanning Tree Algorithm for the Application-Layer Multicast 应用层组播的最小延迟生成树算法
- minimum delay spanning tree 最小延迟生成树
- Study on the Problem of Constrained Minimum Spanning Tree. 约束最小生成树问题研究。
- A standard procedure ensured that orders were relayed with minimum delay to all sub-units in the division. 一种标准的程序保证各种命令可在最短的时间内下达到师属各部门。
- At this point Spanning tree has fully converged. 这时生成树成功聚合。
- By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure. (译)：由克鲁斯卡尔（秩）算法的思想，编制一个最小生成树一个完整的搜索程序。
- Minimum spanning tree data structure source code. Hope useful for all of us. Thanks! 数据结构最小生成树源代码。希望对大家有用。谢谢！
- Based on separable rectilinear minimum spanning tree (SMST), optimal algorithms for rectilinear Steiner tree L_RST and optimal Z_RST are presented. 本文提出了基于可分离最小生成树(SMST)的优化L形直角斯坦(Steiner)树(L_RST)和优化Z_RST的算法。
- Based on spanning tree algorithm that is suitable to data fusion, the principle and features of Minimum Cost Spanning Tree (MCST) is analyzed. 在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
- Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network. 图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。
- The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree (D-MDST) problem. 摘要 本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树（D-MDST）问题，并给出了求解该问题的BCT算法。
- A standard procedureensured that orders were relayed with minimum delay to all sub-units in the division. 一种标准的程序保证各种命令可在最短的时间内下达到师属各部门。
- Virtually the only concept to be used is that of a spanning tree. 更确切地说，只使用了生成树的概念。
- The minimum delay in seconds between attempts to connect to the server, in seconds. Defaults to 5 seconds. 两次尝试连接服务器之间的最小延迟秒数。默认是5秒。
- By representing the multi-dimensional gene expression data as nodes of a tree,MST algorithm can transform the data clustering to the partition of the minimum spanning tree. 聚类分析已成为对基因表达数据进行挖掘以提取生物医学信息的主要方法。
- There will be a minimum delay of 120 seconds after you save the maintenance plan before it appears and can be run on the target server. 在保存维护计划之后,在目标服务器上可以显示并运行该维护计划之前,会出现至少120秒的延迟。
- The Clustering takes advantage of geographic information of all nodes to adapt its cluster number, and forms the k clusters based on Minimum Spanning Tree and Kruskal Algorithm. 聚类时充分考虑到节点分布的地理信息，自适应地调节聚类的数目，再根据图论中最小生成树的理论，利用Kruskal算法将所有节点划分为k类。
- By providing the information specified in the form you will assist the party concerned to process your request with minimum delay. 你在表格上清楚填妥资料,将有助有关方面尽快处理你的查阅资料要求。
- Evidently, the graph must be connected in order to contain a spanning tree. 显然一个图必须是连通的才能包含一生成树。
- With the method,vertexes of graph are stored in fields and edges are expressed in records.A method to traverse graph and calculate the minimum spanning tree of graph is given. 在该方法中,图中各顶点信息用字段来存放,图中的边用记录来表示,给出了在该表示方法中对图进行遍历和求解最小生成树的算法。
