an implementation of min-cut algorithm

Version 1.0.0.0 (2.45 KB) by Hu
min-cut for a connectivity weight graph
4.0
(2)
1.5K Downloads
Updated 3 Aug 2012

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.

Note：it is an simple version of Code by Yohai Devir.

Cite As

Hu (2026). an implementation of min-cut algorithm (https://www.mathworks.com/matlabcentral/fileexchange/37726-an-implementation-of-min-cut-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2009a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers
Tags Add Tags

Version Published Release Notes
1.0.0.0