Ford–Fulkerson algorithm
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.
Nº Q284695 ★
Common · Knowledge
Ford–Fulkerson algorithm
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Xav65 (CC BY-SA 4.0) ·
Related cards
Shor's algorithm
Quantum algorithm for integer factorization
Nº Q940334 ★★★
FIFO (computing and electronics)
Scheduling algorithm, the first piece of data inserted into a queue is processed first
Nº Q515636 ★★★
Bellman–Ford algorithm
Algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
Nº Q816022 ★★
Kruskal's algorithm
Minimum spanning forest algorithm that greedily adds edges
Nº Q797860 ★★
Simon's problem
Problem involving an oracle, which quantum computers can solve exponentially faster than classical computers; an oracle separation of BQP and BPP
Nº Q5763587 ★
Bubble sort
Simple sorting algorithm
Nº Q60864 ★★★