Read the problem at https://cses.fi/problemset/task/1695. You are given a city with intersections and bidirectional roads. The police want to prevent criminals from traveling from intersection to intersection by blocking roads. Find the minimum number of roads to block and list which roads to block.
Each road can be blocked independently. Notice this is asking for the minimum cut between two vertices. The roads are edges with capacity , and you need to find which edges disconnect the source from the sink.