Ford-Fulkerson variations: analyze different augmenting-path choices.
Analyze the ford-fulkerson variations: analyze different augmenting-path choices..
Examples
Input:"test_input_1"
Output:"output_1"
Input:"test_input_2"
Output:"output_2"
Hints
Consider how the choice of augmenting path affects the number of iterations in Ford-Fulkerson. What happens if you always pick the shortest path (in terms of edges)?
Explore the impact of using BFS (Edmonds-Karp) versus DFS for path selection. How does this choice influence the worst-case time complexity?
Investigate the "maximum capacity augmenting path" strategy—always selecting the path with the highest bottleneck capacity. How does this compare to the standard Ford-Fulkerson approach in terms of convergence speed?
Ford-Fulkerson variations: analyze different augmenting-path choices.
Analyze the ford-fulkerson variations: analyze different augmenting-path choices..