Ford-Fulkerson algorithm

Version 1.0.0.0 (1.07 KB) by Bing He
The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl
2.3
(3)
4.8K Downloads
Updated 3 Apr 2008

No License

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.

Cite As

Bing He (2025). Ford-Fulkerson algorithm (https://in.mathworks.com/matlabcentral/fileexchange/19439-ford-fulkerson-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP1
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Ford-Fulkerson/

Version Published Release Notes
1.0.0.0