文件名称:mincut
介绍说明－－下载内容均来自于网络，请自行研究使用
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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
license.txt
mincut.m
mincut.m