genpark-minimum-spanning-tree-kruskal-prim-skill
Enables MCP clients to compute shortest paths, topological dependency orderings, maximum network flows, minimum spanning trees, and PageRank-style centrality over graph topologies using only the Python standard library. It supports optimal multi-agent communication backbone and execution-plan analysis without external graph dependencies.
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.