3014223410http://paper.people.com.cn/rmrb/pc/content/202602/26/content_30142234.htmlhttp://paper.people.com.cn/rmrb/pad/content/202602/26/content_30142234.html11921 解码中德合作的“太仓样本”
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.
，这一点在夫子中也有详细论述
Jordan Davies,BBC Walesand
Юрий Леонов (ведущий редактор отдела «Бывший СССР»)