TU Wien:Diskrete Mathematik für Informatik UE (Gittenberger)/Übungen WS13/Beispiel 27
Zur Navigation springen
Zur Suche springen
Use the algorithm of Ford and Fulkerson to compute a maximal flow in the
network which has two sources and !
Solution[Bearbeiten | Quelltext bearbeiten]
First residual flow:
First flow:
Second residual flow:
Second flow:
Third residual flow:
Third flow:
Fourth residual flow:
Fourth flow:
Final residual flow and minimal cut:
Materialien
Neues Material hinzufügenE
- Exercise 27 - Flow 1.png (details)
- Exercise 27 - Flow 2.png (details)
- Exercise 27 - Flow 3.png (details)
- Exercise 27 - Flow 4.png (details)
- Exercise 27 - Residual Flow 1.png (details)
- Exercise 27 - Residual Flow 2.png (details)
- Exercise 27 - Residual Flow 3.png (details)
- Exercise 27 - Residual Flow 4.png (details)
- Exercise 27.png (details)