Diskussion:Cost minimal maximum flow in graphs: Ford-Fulkerson 2

Comment to "Cost minimal maximum flow in graphs: Ford-Fulkerson 2"

---

After we had read your wiki, we was surprised about the simple way to indicate this algorithm. In the first part there is an understandable introduction. It is an important characteristic that the Ford-Fulkerson-Algorithm (FFA) should find not the shortest way in graphs. The second part includes the steps for the FFA. The last part is your example with the pictures, which make the solution process intelligible. The example you used is clear and includes an good description of the problem, which you want to illustrate. The additional clarifies the way to find the maximum possible flow.

To sum up, we can say you used an good example to show the different steps of the FFA. The wiki is special suitable to deepen the knowledge for the exam.