Ford-Fulkerson algorithm
by Bing He
02 Apr 2008
(Updated 03 Apr 2008)
No BSD License
The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl
Download Now
|
Watch this File
|
| File Information |
| Description |
Main function is function max_flow=ff_max_flow(source,sink,capacity,nodes_number).
The graph is expressed as N by N adjacency matrix. N is the number of vertices in the graph, i.e., "nodes_number". "source","sink" are identified by the node ID. "capacity" is an N by N matrix express the edge capacity. "max_flow" is output max flow found. |
| MATLAB release |
MATLAB 7.0.1 (R14SP1)
|
| Zip File Content |
|
| Other Files |
Ford-Fulkerson/bfs_augmentpath.m,
Ford-Fulkerson/ff_max_flow.m
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (4) |
| 09 Aug 2008 |
Gok s
|
|
|
| 16 Oct 2008 |
Ahmed Rizk
|
|
|
| 08 May 2009 |
Manar
|
|
|
| 12 May 2009 |
Mango
|
|
|
|
MATLAB Central Terms of Use
NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for
all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content.
Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available
via MATLAB Central.
Read the complete Terms prior to use.
Contact us at files@mathworks.com