Source and sink connect?

Greedy Ford-Fulkerson will

find maximum flow.

Teena Carroll
Emory & Henry College

This is a haiku introducing a graph algorithm which finds the maximum capacity which can be sent between two vertices in a weighted graph. Think of vertices connected by a network of tubes. One of the vertices is a sink– picture a drain; another is a source, like a faucet. Each of the tubes has a capacity. How much total goop can be pushed through the tubes. To see another version of a Ford-Fulkerson haiku, see this entry in the Consilience Journal: Carroll