Ford-Fulkerson Algorithm for Max Flow Problem

Version 1.0.0.0 (2,54 ko) par Karl Ezra Pilario
An Edmonds-Karp implementation to solve the Max-flow Min-cut Problem
0.0
(0)
636 téléchargements
Mise à jour 23 nov. 2017

Afficher la licence

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.

Citation pour cette source

Karl Ezra Pilario (2026). Ford-Fulkerson Algorithm for Max Flow Problem (https://fr.mathworks.com/matlabcentral/fileexchange/65167-ford-fulkerson-algorithm-for-max-flow-problem), MATLAB Central File Exchange. Extrait(e) le .

Compatibilité avec les versions de MATLAB
Créé avec R2013b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Statistics and Machine Learning Toolbox dans Help Center et MATLAB Answers
Tags Ajouter des tags
Remerciements

A inspiré : Rearranging Rows for Gauss - Seidel Method

Ouvrir dans un nouvel onglet
Version Publié le Notes de version
1.0.0.0