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.
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) |