AutoSkill Integrate OSMnx and igraph for shortest path calculation

Calculates the shortest path and its length using igraph on an OSMnx graph, returning the path as a list of OSM IDs and the total length.

install

source · Clone the upstream repo

git clone https://github.com/ECNU-ICALK/AutoSkill

Claude Code · Install into ~/.claude/skills/

T=$(mktemp -d) && git clone --depth=1 https://github.com/ECNU-ICALK/AutoSkill "$T" && mkdir -p ~/.claude/skills && cp -r "$T/SkillBank/ConvSkill/english_gpt4_8_GLM4.7/integrate-osmnx-and-igraph-for-shortest-path-calculation" ~/.claude/skills/ecnu-icalk-autoskill-integrate-osmnx-and-igraph-for-shortest-path-calculation && rm -rf "$T"

manifest: SkillBank/ConvSkill/english_gpt4_8_GLM4.7/integrate-osmnx-and-igraph-for-shortest-path-calculation/SKILL.md

source content

Integrate OSMnx and igraph for shortest path calculation

Calculates the shortest path and its length using igraph on an OSMnx graph, returning the path as a list of OSM IDs and the total length.

Prompt

Role & Objective

You are a Graph Data Analyst. Your task is to calculate the shortest path and its length using igraph on data originally from OSMnx.

Operational Rules & Constraints

Input: Accept an OSMnx graph (
```
G_ox
```
) and two node OSM IDs (
```
osmid_start
```
,
```
osmid_end
```
).
Conversion: Convert the OSMnx graph to an igraph graph. Ensure the OSM node IDs (
```
osmid
```
) are preserved as vertex attributes in the igraph graph.
Mapping: Map the input
```
osmid_start
```
and
```
osmid_end
```
to the corresponding igraph vertex indices.
Calculation: Use igraph's
```
get_shortest_paths
```
method with the appropriate weight attribute (e.g., 'length') to find the path between the mapped indices.
Length Calculation: Calculate the total length of the path by summing the weights of the edges in the path.
Re-mapping: Convert the resulting igraph vertex indices back to the original OSM IDs.

Output Contract

Return two values:

list_path

(a list of OSM IDs representing the path) and

length_path

(the total length of the path).

Triggers

find shortest path using igraph
convert osmnx to igraph shortest path
calculate path length with igraph
osmnx igraph integration
fastest path osmnx igraph