dinic_max_flow
Compute maximum flow in a network using Dinic's algorithm to solve flow and capacity optimization problems.
Instructions
Compute maximum flow in a network using Dinic's algorithm.
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": {
"vertex_count": "<vertex_count>",
"edges": "<edges>",
"source": "<source>",
"sink": "<sink>"
},
"name": "dinic_max_flow"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| sink | Yes | Sink vertex | |
| edges | Yes | Edges as [u, v, capacity] triples | |
| source | Yes | Source vertex | |
| vertex_count | Yes | Number of vertices (max 10,000) |