dominicparga/osmgraphing

OpenStreetMap-data and own graph-files are parsed and routing-algorithms compute shortest paths. Further, a graph (or the underlying network) can be optimized by computing a new metric, that reduces the workload of rush-hour-scenarios.

语言：Rust · GitHub 星标：19 · Fork：4

话题：crates · dijkstra · graph · offset · openstreetmap · osm · parsing · pbf

在 GitHub 上查看原仓库