kremis_path
Find the strongest weighted path between two nodes in a deterministic local knowledge graph.
Instructions
Find the strongest weighted path between two nodes
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"start": "<start>",
"end": "<end>"
},
"name": "kremis_path"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| end | Yes | Ending node ID | |
| start | Yes | Starting node ID |