Be the first to rate this file! 34 downloads (last 30 days) File Size: 1.07 KB File ID: #19439

Ford-Fulkerson algorithm

02 Apr 2008 (Updated 03 Apr 2008)

No BSD License

The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl

File Information
Description	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.
MATLAB release	MATLAB 7.0.1 (R14SP1)
Zip File Content
Other Files	Ford-Fulkerson/bfs_augmentpath.m, Ford-Fulkerson/ff_max_flow.m

Tags for This File
Everyone's Tags	maxflow mincut(3), maximum flow(2), minimum cut(2), wireless
Tags I've Applied
Add New Tags	Please login to tag files.

Comments and Ratings (5)
09 Aug 2008	Gok s	Please provide an example
16 Oct 2008	Ahmed Rizk	Please provide an example Best Regards
08 May 2009	Manar	Please provide an example very quickly
12 May 2009	Mango	just follow the description, first create your matrix from command line, then use the command max_flow=ff_max_flow(number of sources,number of sinks, matrix name, number of nodes) it will give you the output max_flow = ? or just find maximum flow min cut using http://www.mathworks.com/access/helpdesk/help/toolbox/bioinfo/index.html?/access/helpdesk/help/toolbox/bioinfo/ref/graphmaxflow.html
17 Feb 2010	Ahmed Hassan	Hello when I enter the set(h.Nodes(K(1,:)),'Color',[1 0 0]) to View Minimum Cut the message appear ??? Undefined variable "h" or class "h.Nodes". please what can I do?

Please login to add a comment or rating.