GTUP (1)

This dataset accompanies the paper "Graph-Theoretic Urban Planning (GTUP): A Multi-Layer Framework for Cities as Complex Networks," which analyses two morphologically contrasting U.S. cities — Fairfax, Virginia (suburban, cul-de-sac-dominated) and Alexandria, Virginia (historic grid with suburban fringe) — as multi-layer coupled networks integrating transport, land-use/points-of-interest, and green infrastructure. All artefacts are derived from the OpenStreetMap snapshot recorded in the accompanying manifest and are projected to EPSG:32618 (UTM Zone 18N). The archive contains: (i) cleaned simple-undirected WALK and DRIVE street networks for both cities as ESRI shapefiles, with OSM node identifiers, vertex degrees, odd/even parity flags, and metric edge lengths; (ii) Minimum Spanning Trees of each network computed with Kruskal's algorithm; (iii) Chinese Postman matched-edge routes — the shortest-path polylines representing edges that a Eulerian closed walk must traverse twice, obtained by exact min-weight perfect matching on odd-degree vertices with k-nearest-neighbour sparsification verification (k = 30 vs 60, Δ agreement < 10⁻⁴%); (iv) the supplementary HAS* optimal TSP tour over 113 Fairfax POIs, solved via Google OR-tools Guided Local Search; (v) POI features classified into four Moreno-category layers (commerce, education, healthcare, recreation) and green-infrastructure polygons; (vi) node-level CSV tables including betweenness centrality, per-category 15-minute accessibility distances, and supra-adjacency rank comparisons; (vii) per-cell JSON outputs recording every metric with its formula, algorithm, and computation time; (viii) all manuscript figures as PNG; and (ix) a complete reproducibility manifest listing pinned library versions, random seeds, parameter values, and run timestamps.本数据集配套于论文"图论城市规划（Graph-Theoretic Urban Planning, GTUP）：面向作为复杂网络的城市的多层框架"。该研究将两座形态特征迥异的美国城市——弗吉尼亚州费尔法克斯（以郊区尽端路为主导）与弗吉尼亚州亚历山大市（历史网格街区搭配郊区边缘地带）——作为整合了交通、土地利用/兴趣点以及绿色基础设施的多层耦合复杂网络展开分析。所有数据制品均源自随附清单中记录的OpenStreetMap（OSM）快照，并投影至EPSG:32618（UTM 18N分区）坐标系。 该归档文件包含以下内容： (i) 两座城市的经清洗后的无向简单步行（WALK）与驾车（DRIVE）道路网络ESRI形状文件，附带OSM节点标识符、顶点度数、奇偶性标记以及公制边长度； (ii) 采用Kruskal算法（Kruskal's algorithm）计算得到的各网络的最小生成树； (iii) 中国邮路问题匹配边路径——代表欧拉闭合回路必须重复遍历的边的最短路径多段线，通过对奇度顶点执行精确最小权完美匹配，并结合k近邻稀疏化验证（k分别取30与60，差异Δ<10⁻⁴%）得到； (iv) 针对费尔法克斯市113个兴趣点（Points of Interest, POIs）的HAS*最优旅行商问题（Traveling Salesman Problem, TSP）巡回路线，通过Google OR-Tools引导式局部搜索算法求解得到； (v) 分为Moreno分类四大类层的兴趣点特征（商业、教育、医疗、休闲）以及绿色基础设施多边形； (vi) 包含介数中心性（betweenness centrality）、各分类的15分钟可达性距离以及超邻接秩对比的节点级CSV表格； (vii) 记录了所有指标及其公式、算法与计算耗时的逐单元格JSON输出文件； (viii) 所有论文配图的PNG格式文件； (ix) 完整的可复现性清单，列出了固定的库版本、随机种子、参数值与运行时间戳。