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.
Nature, Published online: 24 February 2026; doi:10.1038/d41586-026-00298-1
，推荐阅读旺商聊官方下载获取更多信息
FT Videos & Podcasts
This Tweet is currently unavailable. It might be loading or has been removed.
1. 根据数据范围创建若干个桶