genpark-maximum-flow-edmonds-karp-network-skill
Enables agents to compute shortest paths, topological dependency order, maximum flow and minimum-cut bottlenecks, minimum spanning trees, and PageRank centrality over weighted graphs for routing and execution planning. It exposes these graph-analysis capabilities as MCP tools through a zero-dependency Python server.
Setup details
This source describes a project but provides no normalized endpoint or package identifier. Follow its source listing for setup instructions.
Sources and provenance
- Glama source codeOfficial · Observed
Grouping basis: listing. Exact endpoints or package sets can be grouped automatically; other relationships require evidence review. This does not verify publisher affiliation, connection health, or equivalent capabilities.