an implementation of min-cut algorithm

min-cut for a connectivity weight graph

You are now following this Submission

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://in.mathworks.com/matlabcentral/fileexchange/37726-an-implementation-of-min-cut-algorithm), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
1.0.0.0