A simple min cut algorithm
Find a minimal cut in a graph keeping a set of vertices together
An implementation of "A min cut algorithm" by Stoer and Wagner.
In addition there is an option to find the minimal cut that does not separate a set of vertices.
This is not a mincut-maxflow algorithm.
Updated version.
引用格式
Yohai Devir (2026). A simple min cut algorithm (https://ww2.mathworks.cn/matlabcentral/fileexchange/13892-a-simple-min-cut-algorithm), MATLAB Central File Exchange. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0.0 | improved file description plus a few really minor changes. |
