Algorithms MCP Servers

Deep structural analysis of directed and undirected graphs, providing metrics on connectivity, topology, and node importance.

Calculate Minimum and Maximum Spanning Trees using Kruskal's and Prim's algorithms.

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

Find optimal paths in weighted graphs using Dijkstra, A*, and Bellman-Ford algorithms.

Perform topological sorting on DAGs using Kahn's and DFS algorithms to resolve dependencies and detect cycles.