Skip to contents

Sample Street Networks

Real-world OpenStreetMap walkable networks for benchmark cities in Peru.

streets_cusco
Walkable Street Network of Cusco (Historic Center)
streets_lima
Walkable Street Network of Lima (Historic Center / Damero de Pizarro)
streets_arequipa
Walkable Street Network of Arequipa (Historic Center / Yanahuara)

Topological Diagnostics

Inspect user-supplied street networks for connectivity, dead ends, and undershoots without mutating geometries.

walk_diagnose_network()
Topological and Health Diagnosis for Street Networks
print(<walk_diagnosis>)
Print Method for Street Network Diagnosis
plot(<walk_diagnosis>)
Plot Method for Street Network Diagnosis

Network Construction & Repair

Convert spatial vector data into pedestrian routing graphs with user-controlled snapping and planarization.

walk_build_network()
Build Walkable Graph Network from Street Data
print(<walk_network>)
Print Method for Walk Network

Walkability & Reach Metrics

Multi-threaded isochrone reachable length calculations and route directness evaluation.

walk_compute_reach()
Compute Reachable Walkable Network Length Metric
print(<walk_reach>)
Print Method for Walk Reach Metric
plot(<walk_reach>)
Plot Method for Walk Reach Object
walk_compute_circuity()
Compute Network Circuity (Detour Ratio) for Sampled Junctions

Optimal Pedestrian Routing

Single-pair point-to-point shortest path routing across the street network using compiled Rust Dijkstra.

walk_shortest_path()
Compute Shortest Pedestrian Path Between Two Locations
print(<walk_path>)
Print Method for Walk Path
plot(<walk_path>)
Plot Method for Walk Path

Isochrones & Reachable Envelopes

Multi-threshold concave hull polygons and corridor envelopes for walkable service areas.

walk_isochrone()
Compute Pedestrian Isochrone Polygons and Reachable Subgraphs
print(<walk_isochrone>)
Print Method for Walk Isochrone
plot(<walk_isochrone>)
Plot Method for Walk Isochrone

Network Morphology & Intersection Density

Node valence classification, cul-de-sacs, T-junctions, crossroads, and intersection density.

walk_intersection_density()
Compute Intersection Density and Street Network Morphology
print(<walk_morphology>)
Print Method for Walk Morphology
plot(<walk_morphology>)
Plot Method for Walk Morphology

Facility & POI Accessibility

Multi-threaded cumulative accessibility to urban amenities (schools, health, transit) within walking time budgets.

walk_compute_access()
Compute Cumulative Walkable Accessibility to Points of Interest (POIs)
print(<walk_access>)
Print Method for Walk Access
plot(<walk_access>)
Plot Method for Walk Access

Intervention Scenarios & Street Closures

Simulate pedestrianization, street cuts, and compare before/after walkability metrics.

walk_scenario_close()
Simulate Street Closure or Pedestrianization Intervention Scenario
walk_compare_scenarios()
Compare Baseline and Intervention Scenarios
print(<walk_comparison>)
Print Method for Walk Comparison
plot(<walk_comparison>)
Plot Method for Walk Comparison

Centrality & Network Betweenness

Calculate edge betweenness centrality, identify structural bottlenecks, and evaluate flow redistribution under street closures.

walk_betweenness()
Street Network Edge Betweenness Centrality
print(<walk_betweenness>)
Print Method for Walk Betweenness
plot(<walk_betweenness>)
Plot Method for Walk Betweenness
walk_scenario_betweenness()
Simulate Scenario Closures and Evaluate Betweenness Re-routing
print(<walk_scenario_betweenness>)
Print Method for Walk Scenario Betweenness

Graph Interoperability

Seamless conversion to standard R spatial graph classes (sfnetworks, tidygraph).

as_sfnetwork()
Convert Walk Network to sfnetworks Graph
as_tidygraph()
Convert Walk Network to tidygraph tbl_graph

Interactive Web Application (mapgl)

GPU-accelerated MapLibre GL interactive dashboard for real-time reach, isochrones, routing, and scenario analysis.

walk_app()
Launch the Interactive Walkability Application

Cartographic Visualizations

Publication-grade ggplot2 maps and minimalist cartographic themes.

walk_plot_reach()
Plot Reachable Walkable Network Length Map
walk_plot_diagnosis()
Plot Street Network Topological Diagnosis
theme_walkability()
Modern Minimalist Cartographic Theme for Walkability

Data Ingestion

Automated street network acquisition from OpenStreetMap.

walk_download_osm()
Download OpenStreetMap Street Network Data

Rust Acceleration Kernels

Low-level compiled Rust routines for CSR conversion and parallel Dijkstra search.

rust_build_csr()
Build Compressed Sparse Row (CSR) graph representation. Drops self-loops, collapses parallel edges to minimum travel time, and returns CSR structures along with connected component analysis.
rust_compute_reachable_length()
Compute reachable walkable network length in parallel for a set of target nodes.
rust_compute_circuity_sample()
Compute detour ratio (circuity) for sampled origin-destination pairs.
rust_shortest_path()
Compute shortest path between source and target nodes using Dijkstra.
rust_isochrone_subgraph()
Extract reachable edges and nodes within cutoff time from an origin node.
rust_compute_access_multi()
Compute cumulative POI accessibility for target nodes in parallel.