求最小生成树的邻接矩阵法

求图的最小生成树,目前已有多种算法.今介绍一种新的算法——邻接矩阵法,叙述该算法的步骤,进行理论证明,并给出一个说明本算法的实例所述算法形象直观、容易理解、求解过程简便、易于在计算机上实现.特别是它为求解工程上经常遇到的某种“受限最小生成树”提供了新的途径.比如,当PLAN型计算机网络的拓扑结构和其限制条件较为复杂时,使用邻接矩阵法编制其求解的计算机程序结构清晰,调试容易.

Adjacent Matrix Algorithm to Solve Minimum Spanning Tree

Adjacent Matrix Algorithm is a new method to get a minimum spa-nning tree of a graph.This algorithm is easy to understand, to solve and to complete on computer, especially for a type of problem called restrictive minimum spanning tree which usually appears while to solve a topology structure of computer network.The algorithm is described and certified, and an example is included.The algorithm is of great importance to solve PLAN computer network topology.