A simple min cut algorithm

버전 1.0.0.0 (3.19 KB) 작성자: Yohai Devir
Find a minimal cut in a graph keeping a set of vertices together
다운로드 수: 4.4K
업데이트 날짜: 2008/2/25

라이선스 보기

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 CenterMATLAB 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.