hopcroft_karp
Computes maximum bipartite matching from left and right vertex counts plus edge pairs using the Hopcroft-Karp algorithm in O(E√V) time.
Instructions
Find maximum matching in a bipartite graph using the Hopcroft-Karp algorithm in O(E * sqrt(V)).
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": {
"left_size": "<left_size>",
"right_size": "<right_size>",
"edges": "<edges>"
},
"name": "hopcroft_karp"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Edges as [left_vertex, right_vertex] pairs | |
| left_size | Yes | Number of vertices on the left side | |
| right_size | Yes | Number of vertices on the right side |