Introduction | Nomenclature | Spatial clustering versus spatially-constrained clustering | Spatial clustering | Spatially-constrained clustering | Algorithms for spatially-constrained clustering | The SKATER algorithm | The REDCAP algorithms | The "full" clustering algorithm | Using the package | Distance-based versus covariance-based clustering | Observation and reference matrices for covariance clustering | Observation and reference matrices for correlation clustering | Clustering Origin-Destination (OD) matrices | Interpretation of OD clusters | Appendix: Why clusters of significant net in- or out-flow can not be identified | A formal argument | References

Introduction | Nomenclature | Spatial clustering versus spatially-constrained clustering | Spatial clustering | Spatially-constrained clustering | Algorithms for spatially-constrained clustering | The SKATER algorithm | The REDCAP algorithms | The "full" clustering algorithm | Using the package | Distance-based versus covariance-based clustering | Observation and reference matrices for covariance clustering | Observation and reference matrices for correlation clustering | Clustering Origin-Destination (OD) matrices | Interpretation of OD clusters | Appendix: Why clusters of significant net in- or out-flow can not be identified | A formal argument | References

1 Flow Aggregation | 2 Flow Dispersal | 3 Merging directed flows | 4. Flows from spatial interaction models | 5 Flows under optimal allocation | Optimization algorithms

1 Background: Directed Graphs | 1.1 Dual-Weighted Directed Graphs | 2 Introduction to dodgr | 3 Graphs and Street Networks | 3.1 Graph Components | 3.2 Weighting Profiles | 3.3 Random Sub-Graphs | 4 Distance Matrices: dodgr_dists() | 4.1 Aligning Routing Points to Graphs | 4.2 Shortest Path Calculations: Priority Queues | 5 Graph Contraction | 5.1 Routing on Contracted Graphs | 6 Shortest Paths | Bibliography

1 Street Networks and Time-Based Routing | 2. Silicate data and the dodgr_streetnet_sc() function | 3. The weight_streetnet() function | 3.1 Weighting profiles and the write_dodgr_wt_profile function | 4. Time-based routing and the dodgr_times() function | 4.1 Time-based paths and flow aggregation

1 Full Distance Information for Edge Categories | 2. Proportional Distances along each Edge Category | 3. Proportional Distances within a Threshold Distance

1 Background: GTFS and other R packages | 2. Routing | 2.1 GTFS Timetables | 2.2. Routing by mode of transport | 2.3. Routing for earliest arrivals or earliest departures | 3. Convenience Functions: go_home() and go_to_work()

Basic Usage | Extending transfer tables | Modifying transfer tables | Transfer distances | Transfer distances and travel times | A more realistic example

Maximum Traveltimes | Fastest Routes versus Minimal-Transfer Routes | The Traveltimes Algorithm

Accuracy of estimated motorcar travel times