construct a graph as followsvertices: from 0 to n, n+1 vertices, where 0 is outside edges: weight of edge = number of tunnel connecting the two vertices perform standard max-flow algorithm is that right?

disagreeLet the edges being: 1 2 2 0 1 3 3 0 1 4 4 0 is the max-flow 3? if true, then disagree since we can wait until the spy enter one of 2, 3 or 4.