find_path
Find the shortest path between two items in a knowledge graph. Traverses edges up to a set depth and returns the ordered list of item IDs and edge types.
Instructions
Find the shortest path between two items in your knowledge graph. Traverses knowledge_edges up to max_depth hops and returns the ordered list of item IDs and edge types along the path, or "no path found" if disconnected.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| item_a | Yes | UUID of the start item | |
| item_b | Yes | UUID of the end item | |
| max_depth | No | Maximum path length to search (default 5) |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| found | Yes | ||
| path_length | Yes | ||
| path_item_ids | Yes | ||
| path_edge_types | Yes |