Integrate Osmnx And Igraph For Shortest Path Calculation

What the source does

• FilesystemNone observedNo reads or writes in the source
• NetworkNone observedNo outbound calls in the source
• ShellNone observedNo commands run in the source
• DependenciesPinnedNothing floats
• SecretsNone foundNo keys in source

Five audit layers

Gates applied: no behavioural pass.

Audit 0.4.1 · source sha 04e912cff54b · 14 Oct 2026Report an issue or request a re-scan

• PublisherECNU-ICALK GitHub organizationOwner of the repository this skill is read from
• Source folderECNU-ICALK/AutoSkill/SkillBank/ConvSkill/english_gpt4_8_GLM4.7/integrate-osmnx-and-igraph-for-shortest-path-calculationThe exact folder we audited
• LicenceNot declaredAs the repository states it
• Commit pinned for this verdict04e912cff54bA new audit runs when the source changes
• Repository statusNot archivedLast push 157 days ago
• Sandboxed runNot runSkills are read, not executed; layer L4 is skipped

Its description: 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.

---
id: "50f21188-7d19-4dfb-a9fd-1ff70fcce2ae"
name: "Integrate OSMnx and igraph for shortest path calculation"
description: "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."
version: "0.1.0"
tags:
  - "osmnx"
  - "igraph"
  - "shortest path"
  - "graph conversion"
  - "routing"
  - "python"
triggers:
  - "find shortest path using igraph"
  - "convert osmnx to igraph shortest path"
  - "calculate path length with igraph"
  - "osmnx igraph integration"
  - "fastest path osmnx igraph"
---

# 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
1. **Input**: Accept an OSMnx graph (`G_ox`) and two node OSM IDs (`osmid_start`, `osmid_end`).
2. **Conversion**: Convert the OSMnx graph to an igraph graph. Ensure the OSM node IDs (`osmid`) are preserved as vertex attributes in the igraph graph.
3. **Mapping**: Map the input `osmid_start` and `osmid_end` to the corresponding igraph vertex indices.
4. **Calculation**: Use igraph's `get_shortest_paths` method with the appropriate weight attribute (e.g., 'length') to find the path between the mapped indices.
5. **Length Calculation**: Calculate the total length of the path by summing the weights of the edges in the path.
6. **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

Excerpt, first 2,022 characters of SKILL.md, verbatim from the audited commit. It is text from someone else’s repository, quoted so you can judge it before your agent reads it.

git clone https://github.com/ECNU-ICALK/AutoSkill
git -C AutoSkill checkout 04e912cff54b

Works in

1. 2026-10-14
   ✓SAFE B 89 / 100

   first audit · source 04e912cff54b

Questions about Integrate Osmnx And Igraph For Shortest Path Calculation

• github.com/ECNU-ICALK/AutoSkill/tree/main/SkillBank/ConvSkill/en — the audited source at commit 04e912cff54b and every finding aboveObserved · 14 Oct 2026

Spotted something wrong? Report a correction · Methodology