摘要
本文提出了求图的全部生成树的新算法.它能系统地生成全部树,且不产生冗余项.本算法原理简单、步骤较少、速度较快,并容易在计算机上实现.最后用实例进行了说明.
This paper presents a new algorithm for finding all the spanning trees of a graph. It can generate all the spanning trees systematically without the redandant terms. The principle of the algorithm is simple,steps are less and speed is faster. It is also easy for a computer. Eventually examples in the paper illustrate it.
关键词
图
生成树
算法
graph
spanning trees
algorithm
