get_graph_path
Find the shortest connection (up to 4 hops) between two cricket entities in a knowledge graph, returning the path as a list with canonical URLs or 'connected=false' if none exists.
Instructions
Shortest connection (≤4 hops) between two cricket entities in the knowledge graph — e.g. how one player links to another via a shared franchise. Returns the path as a list of entities with canonical URLs, or connected=false if none within maxDepth. Use for "how is Kohli connected to Bumrah".
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| toSlug | Yes | End entity slug | |
| fromSlug | Yes | Start entity slug | |
| maxDepth | No | Default 3, max 4 |