文件名称:flower-tree
介绍说明－－下载内容均来自于网络，请自行研究使用
所谓的带花树算法就是，把整个圈缩成一个点，Edmonds称这个超级点为“花”，就是说，原圈里的所有点都作为外点，然后继续搜索。再之后的过程中，已经被缩的点还可能被嵌套地收缩。
当我们找到一条增广路之后，还要把路上的“花”展开。
总之，带花树的算法思想就是缩点-继续找增广路-找到之后把花展开。
这个算法的思想并不难理解、难的是实现。
-The algorithm is called with trees and flowers, the whole circle shrunk to a point, Edmonds said this super spot for " flower" , that is, the original circles as an external point of all points, and then continue the search. And then later in the process, have been reduced to the point of contraction may also be nested. When we find an augmenting path after, but also the way the " flower" to start. In short, the algorithm is thinking with blooms shrink point- keep looking augmenting path- After finding the flowers unfold. The idea of the algorithm is not difficult to understand, difficult to achieve.
当我们找到一条增广路之后，还要把路上的“花”展开。
总之，带花树的算法思想就是缩点-继续找增广路-找到之后把花展开。
这个算法的思想并不难理解、难的是实现。
-The algorithm is called with trees and flowers, the whole circle shrunk to a point, Edmonds said this super spot for " flower" , that is, the original circles as an external point of all points, and then continue the search. And then later in the process, have been reduced to the point of contraction may also be nested. When we find an augmenting path after, but also the way the " flower" to start. In short, the algorithm is thinking with blooms shrink point- keep looking augmenting path- After finding the flowers unfold. The idea of the algorithm is not difficult to understand, difficult to achieve.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
flower-tree.txt