Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.
文中着重研究构建最小延迟应用层组播树的算法，提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。
Design requirements: the use of algorithms for network Prims minimum spanning tree to the text of the various forms of output spanning tree edges and their weights.
设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
Design requirements: the use of algorithms for network Prims minimum spanning tree to the text of the various forms of output spanning tree edges and their weights.
设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
应用推荐