- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 2kb
- Update:
- 2014-11-25
- Downloads:
- 0 Times
- Uploaded by:
- 蓝星超
Description: 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.
To Search:
File list (Check if you may need any files):
flower-tree.txt
Download