Package: walkability 0.1.0

Paul E. Santos Andrade

walkability: Urban Walkability and Active Transit Network Analysis

High-performance geospatial graph analysis for urban street networks, walkability, and active mobility. Features topological diagnostics and controlled repair for user-provided networks, street-network acquisition from 'OpenStreetMap', multi-threaded Rust kernels for isochrone-based reachable-network length metrics with partial-edge credits, and publication-ready 'ggplot2' visualizations. The accessibility measures draw on Hansen (1959) <doi:10.1080/01944365908978307>; street-network analysis follows Boeing (2017) <doi:10.1016/j.compenvurbsys.2017.05.004>; and betweenness centrality follows Freeman (1977) <doi:10.2307/3033543>.

Authors:Paul E. Santos Andrade [aut, cre, cph]

walkability_0.1.0.tar.gz
walkability_0.1.0.zip(r-4.7-x86_64)walkability_0.1.0.zip(r-4.6-x86_64)
walkability_0.1.0.tar.gz(r-4.7-arm64)walkability_0.1.0.tar.gz(r-4.7-x86_64)walkability_0.1.0.tar.gz(r-4.6-arm64)walkability_0.1.0.tar.gz(r-4.6-x86_64)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
walkability/json (API)

# Install 'walkability' in R:
install.packages('walkability', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/paulesantos/walkability/issues

Pkgdown/docs site:https://paulesantos.github.io

Datasets:

On CRAN:

Conda:

rustcargo

3.40 score 25 exports 33 dependencies

Last updated from:6519c141a0. Checks:7 OK, 3 FAIL. Indexed: yes.

TargetResultTimeFilesSyslog
linux-devel-arm64OK192
linux-devel-x86_64OK151
source / vignettesOK232
linux-release-arm64OK158
linux-release-x86_64OK182
windows-devel-arm64FAIL490
windows-devel-x86_64OK218
windows-release-arm64FAIL452
windows-release-x86_64OK255
wasm-releaseFAIL168

Exports:as_sfnetworkas_tidygraphrust_build_csrrust_compute_access_multirust_compute_circuity_samplerust_compute_reachable_lengthrust_isochrone_subgraphrust_shortest_paththeme_walkabilitywalk_appwalk_betweennesswalk_build_networkwalk_compare_scenarioswalk_compute_accesswalk_compute_circuitywalk_compute_reachwalk_diagnose_networkwalk_download_osmwalk_intersection_densitywalk_isochronewalk_plot_diagnosiswalk_plot_reachwalk_scenario_betweennesswalk_scenario_closewalk_shortest_path

Dependencies:classclassIntclicpp11DBIe1071farverggplot2gluegtableisobandKernSmoothlabelinglifecyclemagrittrpillarpkgconfigproxyR6RColorBrewerRcpprlangs2S7scalessftibbleunitsutf8vctrsviridisLitewithrwk

Análisis Avanzado de Redes Peatonales: Ruteo, Isócronas, Accesibilidad y Simulación
Introducción | 1. Carga de Datos y Preparación de la Red | 2. Ruteo Peatonal Origen-Destino y Circuidad (walk_shortest_path) | 3. Polígonos de Isócronas y Subredes Alcanzables (walk_isochrone) | 4. Morfología Urbana y Tipología de Intersecciones (walk_intersection_density) | 5. Accesibilidad Acumulativa a Equipamientos Urbanos (walk_compute_access) | 6. Simulación de Intervenciones Urbanas y Análisis de Escenarios | 7. Interoperabilidad con sfnetworks y tidygraph | Conclusión

Last update: 2026-11-17
Started: 2026-11-17

Guía de Inicio Rápido: Análisis de Caminabilidad Urbana con walkability
Introducción | 1. Flujo de Trabajo con Datos del Usuario | Paso 1: Carga y Diagnóstico No Invasivo de la Red | Paso 2: Construcción del Grafo y Reparación Opcional | 2. Cálculo de la Métrica de Caminabilidad (Rust) | 3. Visualización Cartográfica con ggplot2 | 4. Análisis de Circuidad y Desvío de Rutas

Last update: 2026-11-17
Started: 2026-11-17

Metodología, Algoritmo Dijkstra en Rust y Supuestos del Modelo
1. Definición Teórica de la Métrica | 2. La Regla de Crédito Parcial (Partial-Edge Rule) | 3. Modelo de Velocidad Peatonal | 4. Implementación del Motor en Rust | 5. Supuestos y Limitaciones del Modelo

Last update: 2026-11-17
Started: 2026-11-17

Resultados de Referencia: Cusco, Arequipa y Lima
Comparativa Empírica en Tres Ciudades Peruanas | 1. Estadísticas de Caminabilidad (Isócrona de 10 minutos) | 2. Dimensiones y Topología de la Red Peatonal | Mapas Cartográficos de Caminabilidad | Cusco | Arequipa | Lima | Hallazgos Principales

Last update: 2026-11-17
Started: 2026-11-17

Visualización Cartográfica Avanzada: Personalización con ggplot2 y Composición con patchwork
Introducción: La Filosofía de Gráficos Composables | 1. Carga de Paquetes y Preparación de la Red Vial | 2. Personalización de Atributos Gráficos con ggplot2 | 2.1. Gráfico Base y Sobrescritura de Temas | 2.2. Tema Integrado con Soporte de Modo Oscuro (dark = TRUE) | 2.3. Incorporación de Capas Vectoriales Adicionales (geom_sf) | 3. Composición Cartográfica Avanzada con patchwork | 3.1. Caso 1: Panel Doble Horizontal (Isócronas vs. Morfología Urbana) | 3.2. Caso 2: Dashboard Tríptico de Movilidad y Ruteo | 3.3. Caso 3: Evaluación de Escenarios de Intervención Urbana (Antes vs. Después) | 4. Unificación de Estilos Globales con el Operador & | 5. Exportación en Alta Resolución para Publicación (ggsave) | Resumen de Mejores Prácticas

Last update: 2026-11-17
Started: 2026-11-17

Readme and manuals

Help Manual

Help pageTopics
Convert Walk Network to sfnetworks Graphas_sfnetwork as_sfnetwork.walk_network
Convert Walk Network to tidygraph tbl_graphas_tidygraph as_tidygraph.walk_network
Plot Method for Walk Accessplot.walk_access
Plot Method for Walk Betweennessplot.walk_betweenness
Plot Method for Walk Comparisonplot.walk_comparison
Plot Method for Street Network Diagnosisplot.walk_diagnosis
Plot Method for Walk Isochroneplot.walk_isochrone
Plot Method for Walk Morphologyplot.walk_morphology
Plot Method for Walk Pathplot.walk_path
Plot Method for Walk Reach Objectplot.walk_reach
Print Method for Walk Accessprint.walk_access
Print Method for Walk Betweennessprint.walk_betweenness
Print Method for Walk Comparisonprint.walk_comparison
Print Method for Street Network Diagnosisprint.walk_diagnosis
Print Method for Walk Isochroneprint.walk_isochrone
Print Method for Walk Morphologyprint.walk_morphology
Print Method for Walk Networkprint.walk_network
Print Method for Walk Pathprint.walk_path
Print Method for Walk Reach Metricprint.walk_reach
Print Method for Walk Scenario Betweennessprint.walk_scenario_betweenness
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_build_csr
Compute cumulative POI accessibility for target nodes in parallel.rust_compute_access_multi
Compute detour ratio (circuity) for sampled origin-destination pairs.rust_compute_circuity_sample
Compute reachable walkable network length in parallel for a set of target nodes.rust_compute_reachable_length
Extract reachable edges and nodes within cutoff time from an origin node.rust_isochrone_subgraph
Compute shortest path between source and target nodes using Dijkstra.rust_shortest_path
Walkable Street Network of Arequipa (Historic Center / Yanahuara)streets_arequipa
Walkable Street Network of Cusco (Historic Center)streets_cusco
Walkable Street Network of Lima (Historic Center / Damero de Pizarro)streets_lima
Modern Minimalist Cartographic Theme for Walkabilitytheme_walkability
Launch the Interactive Walkability Applicationwalk_app
Street Network Edge Betweenness Centralitywalk_betweenness
Build Walkable Graph Network from Street Datawalk_build_network
Compare Baseline and Intervention Scenarioswalk_compare_scenarios
Compute Cumulative Walkable Accessibility to Points of Interest (POIs)walk_compute_access
Compute Network Circuity (Detour Ratio) for Sampled Junctionswalk_compute_circuity
Compute Reachable Walkable Network Length Metricwalk_compute_reach
Topological and Health Diagnosis for Street Networkswalk_diagnose_network
Download OpenStreetMap Street Network Datawalk_download_osm
Compute Intersection Density and Street Network Morphologywalk_intersection_density
Compute Pedestrian Isochrone Polygons and Reachable Subgraphswalk_isochrone
Plot Street Network Topological Diagnosiswalk_plot_diagnosis
Plot Reachable Walkable Network Length Mapwalk_plot_reach
Simulate Scenario Closures and Evaluate Betweenness Re-routingwalk_scenario_betweenness
Simulate Street Closure or Pedestrianization Intervention Scenariowalk_scenario_close
Compute Shortest Pedestrian Path Between Two Locationswalk_shortest_path