int randomIdx = low + rand() % (high - low + 1);
To find these crucial border points, we employed a clever technique based on the Ford-Fulkerson algorithm. By simulating "flooding" roads with traffic from random start/end points, we could identify the natural bottlenecks – the "minimum cut" in graph theory terms. These bottlenecks became our border points.
，这一点在safew官方版本下载中也有详细论述
语重心长的叮嘱，既指明认识论，也给出方法论。
// 3. Save the copies