Ford-Fulkerson Algorithm for Max Flow Problem

バージョン 1.0.0.0 (2.54 KB) 作成者: Karl Ezra Pilario
An Edmonds-Karp implementation to solve the Max-flow Min-cut Problem
0.0
(0)
ダウンロード: 620
更新 2017/11/23

ライセンスの表示

See details of the Max-flow problem in http://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/
The first example in the code (as well as the thumbnail image) is taken from the same website above.

This MATLAB code works with an adjacency matrix to represent the graph. It also contains the function "findpath" which is a BFS (Breadth-first search) implementation for finding augmenting paths. Paths are stored using a predecessor array. I tried to make the code look elegant. :)

The output is the maximum flow and the residual graph.

引用

Karl Ezra Pilario (2025). Ford-Fulkerson Algorithm for Max Flow Problem (https://www.mathworks.com/matlabcentral/fileexchange/65167-ford-fulkerson-algorithm-for-max-flow-problem), MATLAB Central File Exchange. に取得済み.

MATLAB リリースの互換性
作成: R2013b
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux
カテゴリ
Help Center および MATLAB Answers で Statistics and Machine Learning Toolbox についてさらに検索
謝辞

ヒントを与えたファイル: Rearranging Rows for Gauss - Seidel Method

Community Treasure Hunt

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

Start Hunting!

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