Ford-Fulkerson algorithm
The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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 (2026). Ford-Fulkerson algorithm (https://www.mathworks.com/matlabcentral/fileexchange/19439-ford-fulkerson-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (1.07 KB)
-
No License
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
