dodgr - Distances on Directed Graphs
Distances on dual-weighted directed graphs using priority-queue shortest paths (Padgham (2019) <doi:10.32866/6945>). Weighted directed graphs have weights from A to B which may differ from those from B to A. Dual-weighted directed graphs have two sets of such weights. A canonical example is a street network to be used for routing in which routes are calculated by weighting distances according to the type of way and mode of transport, yet lengths of routes must be calculated from direct distances.
Last updated
distanceopenstreetmaproutershortest-pathsstreet-networkscpp
11.40 score 136 stars 5 dependents 272 scripts 711 downloads
gtfsrouter - Routing with 'GTFS' (General Transit Feed Specification) Data
Use 'GTFS' (General Transit Feed Specification) data for routing from nominated start and end stations, for extracting 'isochrones', and travel times from any nominated start station to all other stations.
Last updated
gtfsgtfsrouterpublic-transportationroutercpp
9.34 score 104 stars 3 dependents 49 scripts 236 downloadsm4ra - Many-to-Many Multi-Modal Routing Aggregator
Many-to-many multi-modal routing aggregator, combining 'dodgr' and 'gtfsrouter' for complete routing through urban networks.
Last updated
gtfsopen-street-maprouting-enginecpp
4.26 score 15 stars 2 dependents 1 scriptsuaengine - Routing and aggregation engine for 'Urban Analyst'
Routing and aggregation engine for 'Urban Transport Analyst'.
Last updated
cpp
3.85 score 7 starsttcalib - Calibration of travel times to empirical data
Calibration of travel times to empirical data.
Last updated
2.00 score 2 stars