find_connections
Discover relationship paths between entities in a knowledge graph using BFS traversal. Find how two entities are connected by exposing the chain of edges linking them.
Instructions
Discover relationship paths between entities in the knowledge graph. Uses BFS traversal to find how entities connect. Useful for answering 'how is X related to Y?' questions. Requires enhanced mode. Read-only. Returns: {from, to, max_depth, paths_found, paths[]} where each path is array of {from, to, type} edges.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| max_depth | No | Maximum relationship hops to traverse. Range: 1-5. Higher values exponentially increase results. Default: 2. | |
| to_entity | No | Target entity name. If omitted, returns all reachable entities up to max_depth. | |
| from_entity | Yes | Starting entity name for path search. Must match an entity in the knowledge graph exactly. |