No packages match

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.77 score 142 stars 5 dependents 287 scripts 1.3k 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.48 score 107 stars 3 dependents 65 scripts 500 downloads

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

gtfsopen-street-maprouting-enginecpp

4.35 score 15 stars 2 dependents 1 scripts

spatialcluster - Spatially Contiguous Clustering with the 'Redcap' Algorithm

Groups spatial data into clusters of similar observations, while requiring that each cluster forms a single spatially contiguous region. Contiguity is enforced by first building a spanning tree from the spatial relationships between points, and then cutting that tree into clusters according to a matrix of distances or other measures of similarity. Trees may be built from first-order relationships only (direct neighbours), yielding a minimum spanning tree, or from full-order relationships between entire clusters, using single linkage (nearest members), average linkage (mean of all pairs), or complete linkage (furthest members). The single and average linkage methods implement the 'Redcap' algorithm ('Regionalization' with dynamically constrained agglomerative clustering and partitioning). Results can be visualised as maps of clusters, cluster hulls, or trees.

Last updated

clusterclustering-algorithmspatialcpp

4.23 score 34 stars 1 scripts

spatialcluster - Spatially Contiguous Clustering with the 'Redcap' Algorithm

Groups spatial data into clusters of similar observations, while requiring that each cluster forms a single spatially contiguous region. Contiguity is enforced by first building a spanning tree from the spatial relationships between points, and then cutting that tree into clusters according to a matrix of distances or other measures of similarity. Trees may be built from first-order relationships only (direct neighbours), yielding a minimum spanning tree, or from full-order relationships between entire clusters, using single linkage (nearest members), average linkage (mean of all pairs), or complete linkage (furthest members). The single and average linkage methods implement the 'Redcap' algorithm ('Regionalization' with dynamically constrained agglomerative clustering and partitioning). Results can be visualised as maps of clusters, cluster hulls, or trees.

Last updated

clusterclustering-algorithmspatialcpp

4.23 score 34 stars 1 scripts

uaengine - Routing and aggregation engine for 'Urban Analyst'

Routing and aggregation engine for 'Urban Transport Analyst'.

Last updated

cpp

4.02 score 7 stars

neighbourhoods - Efficient Identification of Neighbourhoods within Networks

Algorithm for efficient identification of neighbourhoods within networks.

Last updated

cpp

2.48 score 6 stars 1 scripts

ttcalib - Calibration of travel times to empirical data

Calibration of travel times to empirical data.

Last updated

2.00 score 2 stars