network-accessibility-analysis

Solid

Always invoke for access to facilities or opportunities by walking, driving, cycling, or public transport, even for a conceptual question with no routing terms or data yet. Covers hospital and service access, transit/GTFS, routes, isochrones, OD matrices, closest facility, 2SFCA, walkability, coverage, and equity. Invoke when Euclidean buffers proxy for network access. Use movement-trajectory for observed tracks and MCDA for suitability without network costs.

AI & Automation 27 stars 3 forks Updated 3 weeks ago MIT

Install

View on GitHub

Quality Score: 84/100

Stars 20%
48
Recency 20%
90
Frontmatter 20%
70
Documentation 15%
100
Issue Health 10%
50
License 10%
100
Description 5%
100

Skill Content

# Network & Accessibility Analysis Purpose: replace as-the-crow-flies guesswork with network-true travel costs, at the right scale and with honest assumptions about speeds and modes. First decision on every task: Euclidean distance is only acceptable as a declared approximation — flag it whenever you see it standing in for access. ## Tool selection by scale | Scale | Tool | |---|---| | Neighborhood-city, research flexibility | **OSMnx + NetworkX** | | City-region, many-to-many OD (>10⁴×10⁴) | **r5py** (multimodal + transit w/ GTFS) or **pandana** (contraction-hierarchy speed) | | Production routing service | Valhalla / OSRM / OpenRouteService API | | Proprietary stacks | ArcGIS Network Analyst (script it headlessly) | NetworkX chokes on metro-scale many-to-many — don't loop `shortest_path` over thousands of origins; switch tools instead. ## Graph construction (OSMnx) ```python import osmnx as ox G = ox.graph_from_place("City, Country", network_type="drive") # walk/bike/all G = ox.add_edge_speeds(G) # imputes from highway tags where maxspeed missing G = ox.add_edge_travel_times(G) # edge attr: travel_time (s) G = ox.project_graph(G) # metric CRS before any distance work ``` - **network_type matters**: pedestrian analysis on a `drive` graph misses paths, stairs, plazas; driving on `all` uses footpaths. Match mode. - Imputed speeds are averages by road class — a systematic bias, not noise. State it; calibrate against known trips when stakes ar...

Details

Author
muend
Repository
muend/geoai-skills
Created
2 months ago
Last Updated
3 weeks ago
Language
Python
License
MIT

Bundled in these plugins

Similar Skills

Semantically similar based on skill content — not just same category

AI & Automation Solid

mcda-suitability-analysis

Always invoke for spatial suitability, site selection, AHP, criteria weights, or weighted-overlay work, including audits of inconsistent pairwise judgments and requests for only a final map. Covers consistency, standardization, constraints, ranked surfaces, shortlists, and sensitivity. Route travel-time placement and location-allocation to network-accessibility-analysis.

27 Updated 3 weeks ago
muend
AI & Automation Featured

networkx

Build, analyze, and visualize networks and graphs using NetworkX (Python). Use this skill whenever the user wants to: create graphs or networks, analyze graph properties, compute centrality measures, find shortest paths, detect communities, run graph algorithms, convert graphs to/from matrices or dataframes, visualize networks with matplotlib, import/export graph files (GML, GraphML, GEXF, edgelist, etc.), work with directed or undirected graphs, weighted or multigraphs, perform social network analysis, or do any graph theory computation. Trigger on keywords: networkx, graph, network, nodes, edges, adjacency, shortest path, centrality, community detection, spanning tree, flow, clique, PageRank, bipartite, DAG, topology, graph analysis, social network.

75 Updated 2 days ago
SenolIsci
AI & Automation Listed

networkx

Create, analyze, and visualize complex networks and graphs in Python with NetworkX. Use when working with network/graph data structures, computing graph algorithms (shortest paths, centrality, clustering), detecting communities, generating synthetic networks (random, scale-free, small-world), reading/writing graph file formats, or drawing network topologies. Common applications include social, biological, transportation, and citation networks.

3 Updated 2 weeks ago
userInner