【摘要】 本文给出了一种求两终端无向图最小割集的新算法,此算法只需使用最简单的集合运算即可完成,得到的结果与用其它方法得到的结果完全相同,而这种算法无论对于手算还是计算机来完成都是容易的,在本文中算法的具体实现通过例子来说明.更多还原

【Abstract】 In this paper,we have developed a new simple algorithm for enumenate all minimal cuts beetween terminal pair of anbitrary undirected graph. which could be finished by simple set operation. The result is the same to the one used by other method. Meanwhile this calculating method can be openated either by hand or by computer. The concrete caculating wethod is examplified in this article.更多还原