Maximum Flow (Ford-Fulkerson)

Finds the maximum flow in a network by repeatedly sending flow along augmenting paths until no more can be sent.

Category: graph

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!