The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network.
-
Updated
Oct 2, 2022 - Ruby
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network.
Add a description, image, and links to the ford-fulkerson-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the ford-fulkerson-algorithm topic, visit your repo's landing page and select "manage topics."