Optimization: principles and algorithms, by Michel Bierlaire
Functions
fordFulkerson.m File Reference

Algorithm 24.2: Ford-Fulkerson. 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...
 

Detailed Description

Algorithm 24.2: Ford-Fulkerson.

Implementation of algorithm 24.2 of [1]

Note
Tested with run2402.m
Calls unsaturatedPath
Author
Michel Bierlaire
Date
Thu Apr 9 18:43:39 2015

Definition in file fordFulkerson.m.

Function Documentation

function fordFulkerson ( in  adj,
in  orig,
in  dest,
in  lb,
in  ub 
)

Find the maximum flow between two nodes using the Ford Fulkerson algorithm.

Parameters
adjadjacency matrix of the network. Each nonzero entry corresponds to an arc. The value of the entry is the ID of the arc.
origthe origin node
destthe destination node
lbthe lower bound on the flow
ubthe upper bound on the flow
Returns
flow the optimal flow vector
total the total flow sent
Copyright 2015-2016 Michel Bierlaire