Police Chase - Extracting the Cut

After computing max flow with capacity $1$ on all edges, do a BFS or DFS from node $1$ on the residual graph. Mark all reachable nodes. The min-cut consists of edges $(u,v)$ where $u$ is reachable and $v$ is not.

Collect these edges and output them. The number of such edges equals the max flow value (the minimum number of roads to block). These are the edges you need to remove to disconnect the criminal from escape.