摘要
对图论中赋权无向图中最小生成树问题的数学模型，分析了建立的过程，并证明了各边不构成圈的一个等价条件，最后推广到有向图中，为用数学软件求解图论问题打下基础。
As far as the minimal spanning tree problem for the graph is concerned, the process of the stablishment of the mathe-matical model is analyzed and a equivalent condition of Each side not constituting a circle is proved. The conclusion is promoted to the directed graph.and builds the foundation for using mathematical software to solve the problem.
作者
孙培
刘凯
SUN Pei, LIU Kai （1. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China; 2. Department of Mathematical and Physical Sciences, Henan Institute of Engineering, Zhengzhou 450002, China）
出处
《电脑知识与技术》
2014年第10期6682-6684,共3页
Computer Knowledge and Technology
关键词
最小生成树
赋权无向图
赋权有向图
Minimum spanning tree
Empowerment undirected graph
Empowerment directed graph
