floyd_warshall
Computes all-pairs shortest paths in weighted graphs, supporting directed or undirected edges.
Instructions
Compute all-pairs shortest paths using Floyd-Warshall.
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": {
"edges": "<edges>"
},
"name": "floyd_warshall"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Array of weighted edges | |
| directed | No | Treat as directed graph (default true) |