摘要
本文研究了有向网络中支撑入树的性质 ,提出了在有向网络图中寻找以某一指定点为根的最小支撑入树的一种较简便的算法 。
In this paper, we study the propeties of the spanning incoming tree in a digraph network, and propose a simple algorithm for finding the minimum spanning incoming tree in a digraph network, we also present an example for applying this algorithm.
出处
《数学的实践与认识》
CSCD
北大核心
2002年第6期973-978,共6页
Mathematics in Practice and Theory
关键词
计算方法
有向网络
最小支撑入树
digraph network
spanning incoming tree with a root
minimum spanning incoming tree
