计算最小支撑出树的一种简便算法

An Simple Algorithm for Finding the Minimum Spanning Outgoing Tree in a Network

本文通过对网络中有向支撑出树性质的研究，提出了在有向网络图中寻找以某一定点为根的最小有向支撑出树一种较简便的计算方法，并给出了应用该算法进行实际操作的一个算例．

In this paper, we study the propeties of the spanning outgoing tree in a network,and proposea simple algorithm for finding the minimum spanning outgoing tree in a network,we also presentan example for applying this algorithm.