Description: Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most short-circuit method to determine the 1 percent since the V1 to Vn the most short-circuit and then this as the most short-circuit the expansion of roads, with maximum flow Solving problems to the flow increased to the greatest possible value of this increased traffic flow on the road as soon as possible after the various units arc flows to re- of the cost, so many times iteration eventually be the minimum cost maximum flow.
- [yz5017] - under 50g/s input flow of step response
- [MATLAB] - Feasible point marking the best matching
- [Graph_theory_matlab_program] - Prepared in order to use a collection of
- [maxflow] - On a number of network flow code, proble
- [BPalgorithm] - Flow projections for the BP algorithm, n
- [shibie] - The design of intelligent transportation
- [opf] - Minimum cost maximum flow in an experime
- [deopf] - Is also a minimum cost maximum flow proc
- [cheliangjiance] - The image enhancement processing of the
File list (Check if you may need any files):
最小费用最大流算法通用Matlab程序.m
Download