Ford–Fulkerson algorithm
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called a "method" instead of an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified or it is specified in several implementations with different running times. It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a fully defined implementation of the Ford–Fulkerson method.
- Comment
- enThe Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called a "method" instead of an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified or it is specified in several implementations with different running times. It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a fully defined implementation of the Ford–Fulkerson method.
- Depiction
- Has abstract
- enThe Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called a "method" instead of an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified or it is specified in several implementations with different running times. It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a fully defined implementation of the Ford–Fulkerson method. The idea behind the algorithm is as follows: as long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of the paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.
- Hypernym
- Algorithm
- Is primary topic of
- Ford–Fulkerson algorithm
- Label
- enFord–Fulkerson algorithm
- Link from a Wikipage to an external page
- archive.org/details/algorithmdesign0000klei/page/378
- rrusin.blogspot.com/2011/03/implementing-graph-editor-in-javafx.html
- www.cs.pitt.edu/~kirk/cs1501/animations/Network.html
- community.topcoder.com/tc%3Fmodule=Static&d1=tutorials&d2=maxFlow
- Link from a Wikipage to another Wikipage
- Approximate max-flow min-cut theorem
- Augmenting path
- Berge's theorem
- Big O notation
- Breadth-first search
- Category:Articles with example pseudocode
- Category:Articles with example Python (programming language) code
- Category:Graph algorithms
- Category:Network flow problem
- D. R. Fulkerson
- Depth-first search
- Dinic's algorithm
- Edmonds–Karp
- Edmonds–Karp algorithm
- Euclidean algorithm
- File:Ford-Fulkerson example 0.svg
- File:Ford-Fulkerson example 1.svg
- File:Ford-Fulkerson example 2.svg
- File:Ford-Fulkerson example final.svg
- File:Ford-Fulkerson forever.svg
- Flow network
- Greedy algorithm
- Introduction to Algorithms
- L. R. Ford Jr.
- Max-flow min-cut theorem
- Maximum flow problem
- Ordinal numbers
- Oreilly Media
- Turn restriction routing
- SameAs
- 2eQbE
- Algorisme de Ford-Fulkerson
- Algorithme de Ford-Fulkerson
- Algorithmus von Ford und Fulkerson
- Algoritmo de Ford-Fulkerson
- Algoritmo de Ford-Fulkerson
- Algoritmo di Ford-Fulkerson
- Algoritmul Ford Fulkerson
- Fordův–Fulkersonův algoritmus
- m.0f2hc
- Metoda Forda-Fulkersona
- Q284695
- Thuật toán Ford–Fulkerson
- Алгоритм Форда — Фалкерсона
- Алгоритм Форда — Фалкерсона
- Форд-Фулкерсонов алгоритам
- Ֆորդ-ֆալկերսոնի ալգորիթմ
- שיטת פורד-פלקרסון
- الگوریتم فورد–فالکرسون
- ขั้นตอนวิธีของฟอร์ด-เฟิลเกอร์สัน
- フォード・ファルカーソンのアルゴリズム
- 福特-富尔克森算法
- Subject
- Category:Articles with example pseudocode
- Category:Articles with example Python (programming language) code
- Category:Graph algorithms
- Category:Network flow problem
- Thumbnail
- WasDerivedFrom
- Ford–Fulkerson algorithm?oldid=1121114552&ns=0
- WikiPageLength
- 17365
- Wikipage page ID
- 53777
- Wikipage revision ID
- 1121114552
- WikiPageUsesTemplate
- Template:Algorithm-begin
- Template:Algorithm-end
- Template:Cite book
- Template:Cite journal
- Template:Clear
- Template:Commons category-inline
- Template:Harvtxt
- Template:Mvar
- Template:Reflist
- Template:Short description
- Template:Use American English
