booboo_path
Finds the shortest chain of nodes connecting two node IDs in a graph, returning null if no path exists.
Instructions
Shortest path (chain of nodes) between two node ids; null if unreachable.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | ||
| from | Yes | ||
| maxHops | No | max BFS hops (default 64) |