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 !
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27.png)
Solution[Bearbeiten | Quelltext bearbeiten]
First residual flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Residual_Flow_1.png)
First flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Flow_1.png)
Second residual flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Residual_Flow_2.png)
Second flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Flow_2.png)
Third residual flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Residual_Flow_3.png)
Third flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Flow_3.png)
Fourth residual flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Residual_Flow_4.png)
Fourth flow:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Flow_4.png)
Final residual flow and minimal cut:
-%C3%9Cbungen_WS13-Beispiel_27_-_Exercise_27_-_Residual_Flow_5.png)
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)
