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?