A simple min cut algorithm

Find a minimal cut in a graph keeping a set of vertices together
4.4K Downloads
Updated 25 Feb 2008

View License

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 (2024). A simple min cut algorithm (https://www.mathworks.com/matlabcentral/fileexchange/13892-a-simple-min-cut-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP3
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Construction in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.0.0

improved file description plus a few really minor changes.