How to find the maximum flow or the minimum cut in a network? I know the maximum flow minimum cut theorem but I struggle to find a minimum cut to prove the maximum flow each time I do past papers. Is there a quick way to solve this kind of problem?
Sorry you've not had any responses about this. Are you sure you've posted in the right place? Here's a link to our subject forum which should help get you more responses if you post there.