nyarhi_path
Find the shortest path between two node IDs in a graph. Enter the start and end IDs to compute the minimal route.
Instructions
Find the shortest path between two node ids in the graph.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| end | Yes | ||
| start | Yes | ||
| store | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |