as_sfnetwork            Convert Walk Network to sfnetworks Graph
as_tidygraph            Convert Walk Network to tidygraph tbl_graph
plot.walk_access        Plot Method for Walk Access
plot.walk_betweenness   Plot Method for Walk Betweenness
plot.walk_comparison    Plot Method for Walk Comparison
plot.walk_diagnosis     Plot Method for Street Network Diagnosis
plot.walk_isochrone     Plot Method for Walk Isochrone
plot.walk_morphology    Plot Method for Walk Morphology
plot.walk_path          Plot Method for Walk Path
plot.walk_reach         Plot Method for Walk Reach Object
print.walk_access       Print Method for Walk Access
print.walk_betweenness
                        Print Method for Walk Betweenness
print.walk_comparison   Print Method for Walk Comparison
print.walk_diagnosis    Print Method for Street Network Diagnosis
print.walk_isochrone    Print Method for Walk Isochrone
print.walk_morphology   Print Method for Walk Morphology
print.walk_network      Print Method for Walk Network
print.walk_path         Print Method for Walk Path
print.walk_reach        Print Method for Walk Reach Metric
print.walk_scenario_betweenness
                        Print Method for Walk Scenario Betweenness
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_access_multi
                        Compute cumulative POI accessibility for target
                        nodes in parallel.
rust_compute_circuity_sample
                        Compute detour ratio (circuity) for sampled
                        origin-destination pairs.
rust_compute_reachable_length
                        Compute reachable walkable network length in
                        parallel for a set of target nodes.
rust_isochrone_subgraph
                        Extract reachable edges and nodes within cutoff
                        time from an origin node.
rust_shortest_path      Compute shortest path between source and target
                        nodes using Dijkstra.
streets_arequipa        Walkable Street Network of Arequipa (Historic
                        Center / Yanahuara)
streets_cusco           Walkable Street Network of Cusco (Historic
                        Center)
streets_lima            Walkable Street Network of Lima (Historic
                        Center / Damero de Pizarro)
theme_walkability       Modern Minimalist Cartographic Theme for
                        Walkability
walk_app                Launch the Interactive Walkability Application
walk_betweenness        Street Network Edge Betweenness Centrality
walk_build_network      Build Walkable Graph Network from Street Data
walk_compare_scenarios
                        Compare Baseline and Intervention Scenarios
walk_compute_access     Compute Cumulative Walkable Accessibility to
                        Points of Interest (POIs)
walk_compute_circuity   Compute Network Circuity (Detour Ratio) for
                        Sampled Junctions
walk_compute_reach      Compute Reachable Walkable Network Length
                        Metric
walk_diagnose_network   Topological and Health Diagnosis for Street
                        Networks
walk_download_osm       Download OpenStreetMap Street Network Data
walk_intersection_density
                        Compute Intersection Density and Street Network
                        Morphology
walk_isochrone          Compute Pedestrian Isochrone Polygons and
                        Reachable Subgraphs
walk_plot_diagnosis     Plot Street Network Topological Diagnosis
walk_plot_reach         Plot Reachable Walkable Network Length Map
walk_scenario_betweenness
                        Simulate Scenario Closures and Evaluate
                        Betweenness Re-routing
walk_scenario_close     Simulate Street Closure or Pedestrianization
                        Intervention Scenario
walk_shortest_path      Compute Shortest Pedestrian Path Between Two
                        Locations
