3 ms·How about max-flow min-cut theorem?by alephnan 7y agoHow about max-flow min-cut theorem?anticensor 7y agoThat assumes complete control of the network. Even one unknown link would break the flow optimisation.