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 2 months ago

distanceopenstreetmaproutershortest-pathsstreet-networks

11.23 score 128 stars 4 packages 197 scripts 909 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 1 years ago

gtfsgtfsrouterpublic-transportationrouter

7.01 score 82 stars 21 scripts 389 downloads

uaengine - Routing and aggregation engine for 'Urban Analyst'

Routing and aggregation engine for 'Urban Transport Analyst'.

Last updated 14 days ago

4.56 score 6 stars

m4ra - 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 18 days ago

gtfsopen-street-maprouting-engine

4.50 score 15 stars 2 packages 1 scripts

ttcalib - Calibration of travel times to empirical data

Calibration of travel times to empirical data.

Last updated 6 months ago

2.30 score 2 stars