Max flow: modify networkx source code so a few edges don't hog all the flow

Question

The max-flow algorithm finds the maximum flow through a graph given edge capacities. However, if there is an option between flowing through two edges, it will typically just