Network Flow Calculator

Network Flow Calculator MCP Connector for Claude

A+

Solve maximum flow, minimum cut, and bipartite matching problems using Edmonds-Karp.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner

The Network Flow Calculator is a specialized computational tool designed to solve complex network topology problems. By utilizing the Edmonds-Karp algorithm, it provides precise solutions for finding the maximum possible flow between a source and a sink in a directed graph. Beyond simple flow calculations, this MCP server allows you to identify critical bottlenecks via find_min_cut, which reveals the edges that limit network capacity. Additionally, you can solve assignment and scheduling problems using compute_bipartite_matching by reducing bipartite matching tasks to maximum flow problems. This tool is ideal for analyzing transportation networks, data routing capacities, and resource allocation scenarios.

max-flowmin-cutbipartite-matchinggraph-theoryedmonds-karp

3 tools expose this connector's capabilities to your AI agent.

compute_bipartite_matching

Solve bipartite matching

calculate_max_flow

Calculate the maximum flow in a network

find_min_cut

Find the minimum cut in a network

See how to talk to your AI agent using Network Flow Calculator.

What is the maximum flow in a network with nodes S, A, B, T and edges (S,A,10), (S,B,5), (A,B,2), (A,T,8), (B,T,9) from S to T?

The maximum flow value is 15. The saturated edges are (S,A), (S,B), and (A,T) or similar depending on the path taken.

Find the minimum cut for a network where the max flow is 15 and the current flow distribution includes edge (S,A) at capacity 10.

The minimum cut edges are those that separate the source-side nodes from the sink-side nodes, effectively limiting the total throughput to 15 units.

Match workers [W1, W2] to tasks [T1, T2] with connections (W1,T1), (W1,T2), and (W2,T1).

The maximum number of matches is 2. One possible assignment is W1 to T2 and W2 to T1.

The server uses the Edmonds-Karp algorithm, which is a BFS-based implementation of the Ford-Fulkerson method, to ensure finding the shortest augmenting paths.

Related Connectors