7.4 The Ford-Fulkerson algorithm Flashcards
1
Q
What is the failed greedy approach to find the maximum flow
A
Fails if wrong order
2
Q
What is the residual graph of a flow network
A
3
Q
What is an augmenting path in a flow network
A
4
Q
What is the residual capacity of an edge + path in a flow network
A
5
Q
What is the push function of The Ford-Fulkerson Algorithm (flow networks)
A
6
Q
What is The Ford-Fulkerson Algorithm (flow networks) and its runtime
A
7
Q
Why does The Ford-Fulkerson Algorithm work
A
8
Q
What is the Max-flow min-cut theorem
A
