A simple min cut algorithm
Find a minimal cut in a graph keeping a set of vertices together
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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.
Cite As
Yohai Devir (2026). A simple min cut algorithm (https://nl.mathworks.com/matlabcentral/fileexchange/13892-a-simple-min-cut-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (3.19 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 | improved file description plus a few really minor changes. |
