Each edge is actually stored twice: once in the "forward" direction (indexed and partitioned by the source ID) and once in the "backward" direction (indexed and partitioned by the destination ID).
图的每一条边都被存储了两次：一次正向存储(根据源id做索引和分块)，一次反向存储(根据目的ID做索引和分块)。
To improve the efficiency of automatic maps edge matching of massive digital map data of great regions even global ones, virtual stitching algorithm based on vector ID mapping is presented.
为了改善数字地图图幅自动接边算法在处理大区域甚至全球范围的大数据量图幅接边时效率低的问题，提出了基于矢量id映射的“虚拼接”算法。
To improve the efficiency of automatic maps edge matching of massive digital map data of great regions even global ones, virtual stitching algorithm based on vector ID mapping is presented.
为了改善数字地图图幅自动接边算法在处理大区域甚至全球范围的大数据量图幅接边时效率低的问题，提出了基于矢量id映射的“虚拼接”算法。
应用推荐