You are given a city map with intersections and roads. Each road is bidirectional. The police want to block some roads to prevent criminals from reaching intersection from intersection . What is the minimum number of roads they need to block?
Output that number and list the roads to block. This is a minimum - cut problem where and . Each road has capacity . You are finding the smallest set of roads whose removal disconnects the source from the destination.