today we've been given a special type of network flow which looks like this: We've been tasked to find an algorithm that finds a minimum cut in linear time for this specific type of network. I've been looking at this for a while but still didn't find a solution.The algorithms we've learned in class are Ford-Fulkerson and Edmond-Karp.Thanks for your help!
Finding a minimum S-T cut in a specific network flow
graphs;graph theory;network flow;minimum cuts