Presentation ON

Ford-Fulkerson Algorithm

Prepared By:Md . Abu DardaID: 011 122 005

Overview & History Applications Algorithm Pseudo Code Example Complexity

Outlines

The Ford–Fulkerson algorithm (FFA) is a greedy algorithm  that computes the maximum flow in a flow network.

It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson.

Overview & History

fluid in pipes current in an electrical circuit traffic on roads data flow in a computer network money flow in an economy etc.

Applications

Some Terms We Must Know:

Algorithm

Pseudo Code

Example: