A simple min cut algorithm
版本 1.0.0.0 (3.2 KB) 作者:
Yohai Devir
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 (2024). A simple min cut algorithm (https://www.mathworks.com/matlabcentral/fileexchange/13892-a-simple-min-cut-algorithm), MATLAB Central File Exchange. 检索时间: .
MATLAB 版本兼容性
创建方式
R14SP3
兼容任何版本
平台兼容性
Windows macOS Linux类别
在 Help Center 和 MATLAB Answers 中查找有关 Construction 的更多信息
标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0.0 | improved file description plus a few really minor changes. |