path
Find the shortest connection between two nodes in a graph, ignoring link direction, with the typed links along the path. Returns whether a route
Instructions
How two nodes are connected: the shortest chain of nodes between them, link
direction ignored, with the typed links along it. found is false when there
is no way through. Get the ids from search.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to_id | Yes | ||
| from_id | Yes | ||
| edge_types | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |