Ford-Fulkerson algorithm

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

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)

[Gok s]

Please provide an example

[Ahmed Rizk]

Please provide an example
Best Regards

[Manar]

Please provide an example very quickly

[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

[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?

[kedar]