2 %> Run the FordFulkerson algorithm on Example 24.2 of \cite Bier15-book
8 %> @author Michel Bierlaire
9 %> @date Thu Apr 9 18:45:30 2015
12 adj = [ 0 1 2 3 0 0 0 ;
22 lb = [ 0 0 0 0 0 0 0 0 0 0 0 0 ]
' ; 23 ub = [ 5 3 5 3 3 3 5 1 5 1 2 9 ]' ;
24 flow = [0 0 0 0 0 0 0 0 0 0 0 0]
' ; 26 [flow, total] = fordFulkerson(adj,orig,dest,lb,ub); function fordFulkerson(in adj, in orig, in dest, in lb, in ub)
Find the maximum flow between two nodes using the Ford Fulkerson algorithm.