Query: Strongest Path

Find the path with the highest total weight between two nodes.

method · POST

/query

Authentication: Required (if enabled)

Uses Dijkstra’s algorithm with cost = i64::MAX - weight (higher weight = preferred path).

Request

{
  "type": "strongest_path",
  "start": 0,
  "end": 5
}

Field	Type	Required	Description
type	string	Yes	Must be "strongest_path".
start	integer (u64)	Yes	Starting node ID.
end	integer (u64)	Yes	Target node ID.

Response

200 OK (found)

{
  "success": true,
  "found": true,
  "path": [0, 3, 5],
  "edges": [
    {"from": 0, "to": 3, "weight": 15},
    {"from": 3, "to": 5, "weight": 12}
  ],
  "grounding": "inference",
  "error": null
}

When found is false, diagnostic explains why: start_not_found, end_not_found, or no_path (both nodes exist but no path connects them).

Example

curl -X POST http://localhost:8080/query \
     -H "Content-Type: application/json" \
     -d '{"type": "strongest_path", "start": 0, "end": 5}'