Ford-Fulkerson algorithm

バージョン 1.0.0.0 (1.07 KB) 作成者: Bing He
The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl
ダウンロード: 4.8K
更新 2008/4/3

ライセンスがありません

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.

引用

Bing He (2026). Ford-Fulkerson algorithm (https://jp.mathworks.com/matlabcentral/fileexchange/19439-ford-fulkerson-algorithm), MATLAB Central File Exchange. に取得済み.

MATLAB リリースの互換性
作成: R14SP1
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!
バージョン 公開済み リリース ノート
1.0.0.0