Optimization: principles and algorithms, by Michel Bierlaire

Algorithm 24.2: FordFulkerson. More...
Go to the source code of this file.
Functions  
function  fordFulkerson (in adj, in orig, in dest, in lb, in ub) 
Find the maximum flow between two nodes using the Ford Fulkerson algorithm. More...  
Algorithm 24.2: FordFulkerson.
Implementation of algorithm 24.2 of [1]
Definition in file fordFulkerson.m.
function fordFulkerson  (  in  adj, 
in  orig,  
in  dest,  
in  lb,  
in  ub  
) 
Find the maximum flow between two nodes using the Ford Fulkerson algorithm.
adj  adjacency matrix of the network. Each nonzero entry corresponds to an arc. The value of the entry is the ID of the arc. 
orig  the origin node 
dest  the destination node 
lb  the lower bound on the flow 
ub  the upper bound on the flow 