Ford–Fulkerson algorithm

Ford–Fulkerson is an algorithm used to find the maximum flow in a network. It works by starting with the network full of empty pipes (edges) and slowly filling the pipes up (with the flow) until you can't fill anymore and have reached the maximum flow. It does this by finding the path of pipes that have the most amount of unused space (capacity) and sending the flow from one end of the path to the other until that path is full. Then it looks for the next "most full" path, until all paths are full and you have reached the maximum flow.