find_path
Find the shortest path between two nodes in the knowledge graph, showing each hop and relation to reveal how components connect.
Instructions
Find the shortest path between two nodes in the knowledge graph.
Uses undirected BFS — traverses both outgoing and incoming edges. Useful for understanding how two components are connected.
Args: source_id: Starting node ID. target_id: Destination node ID. max_depth: Maximum path length (default 6, max 10). project: Project name.
Returns: Path from source to target showing each hop and relation.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| project | No | ||
| max_depth | No | ||
| source_id | Yes | ||
| target_id | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |