MATLAB training program (maximum flow/minimum cut)
2016-08-23
5 0 0
4.0
Other
Earn points
This algorithm is preparing for graph cuts algorithm in image processing. Basic concepts: 1. the maximum flow is a directed graph. 2. the maximum flow in a flow is, if and only if it does not include augmenting path in the residual network. 3. the minimum cut is to network all the cuts in the minimum value of the cut, minimum cut is not unique, but the minimum cut value is unique. 4. the maximum flow is equal to the capacity of a minimum cut. Algorithm is the Ford-Fulkerson method.
matlab
程序
最小
练习
最大
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment