find_relation_path
WHEN: you need to know HOW two AOT objects are connected -- the chain of relations linking them. Triggers: 'how is X related to Y', 'comment X est lié à Y', 'path between', 'chemin entre', 'lien entre deux tables', 'connection between', 'is X reachable from Y'. Walks the pre-computed relation graph (FK, DeleteAction, DataSource, Extension, Security edges -- both directions) and returns the SHORTEST navigation path(s) as a chain of object names + edge kinds. Token-light: returns ONLY names and relation kinds, never full object source. O(1)-per-node BFS, no vector scan. Use get_relation_graph for the full neighbourhood of a single object; use this to traverse multiple hops between two known objects.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| source | Yes | Start object name, e.g. 'SalesTable' | |
| target | Yes | Destination object name, e.g. 'CustTable' | |
| maxDepth | No | Maximum hops to traverse (default: 4, max: 8). Higher = slower, more paths. | |
| maxPaths | No | Maximum number of distinct paths to return (default: 5, max: 20). |