shortest_path
Find the shortest route between two concepts in a code knowledge graph, following edge direction by default or ignoring it when undirected search is enabled.
Instructions
Find the shortest path between two concepts in the knowledge graph. Follows stored edge direction by default; set undirected=true to ignore it.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| repo | No | The project to read: its id or key, or with graphicle mcp a synced folder. Defaults to this connection's project. | |
| as_of | No | The code-graph episode to read: an episode id, a label such as a commit sha, latest or working. Defaults to the project's current code graph. | |
| source | Yes | Source concept label or keyword | |
| target | Yes | Target concept label or keyword | |
| max_hops | No | Maximum hops to consider | |
| undirected | No | Ignore stored edge direction when searching |