The Ford–Fulkerson algorithm cardFord–Fulkerson algorithm

Ford–Fulkerson algorithm

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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

Excerpt from the Wikipedia article “Ford–Fulkerson algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Xav65, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Ford–Fulkerson algorithm to your collection.

Play for free

Related cards