Open
Description
It would be helpful to add an algorithm for finding bottleneck edges in the graph.
We can define a bottleneck edge as an edge which capacity needs to be increased to increase the max-flow for a given src-dst pair. There will be a number of interesting subtile problems to make this algorithm useful for networking applications (think we would prefer to improve the capacity over the shortest paths, not any paths).
Maybe we should think of applying dimensioning approach instead (LP problem)? We could easily formulate this problem as a set of linear equations and solve them. But this would require runtime dependency on a linear solver.