kremis_path
Identify the strongest weighted path connecting two nodes in a deterministic local knowledge graph.
Instructions
Find the strongest weighted path between two nodes
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| start | Yes | Starting node ID | |
| end | Yes | Ending node ID |