Skip to main content
Glama
alphaparkinc

genpark-minimum-spanning-tree-kruskal-prim-skill

Official

genpark-minimum-spanning-tree-kruskal-prim-skill

Python 3.9+ License MIT MCP Compatible GenPark AI Zero Dependencies


⚡ Overview & Architectural Significance

genpark-minimum-spanning-tree-kruskal-prim-skill delivers zero-dependency graph pathfinding, topological dependency resolution, network maximum flow, and centrality ranking engineered strictly using Python 3.9+ standard library.

🌟 Key Architectural Capabilities

  • Zero External Dependencies: Operates exclusively via pure Python (heapq, collections, math, json). Zero NetworkX or SciPy build overhead.

  • Enterprise Graph Invariants: Implements formal Dijkstra/A* priority queue path traversal, Kahn's DAG topological sorting, Edmonds-Karp BFS residual flow augmentation, Kruskal's disjoint-set minimum spanning tree, and PageRank random surfer power iteration.

  • Native Anthropic MCP Protocol: Compliant with standard JSON-RPC 2.0 stdio MCP specifications for Claude Desktop, Cursor, and Windsurf.


Related MCP server: genpark-topological-sorter-tarjan-scc-skill

🏗️ Architectural Topology & State Machine

flowchart TD
    GraphInput["Graph Topology: Nodes & Weighted Edges"] --> AlgorithmRouter["Graph & Network Routing Kernel"]
    AlgorithmRouter --> Pathfinder["Dijkstra & A* Shortest Pathfinder"]
    AlgorithmRouter --> DAGAnalyzer["Topological Sorter & Dependency Resolver"]
    AlgorithmRouter --> FlowSolver["Edmonds-Karp Maximum Flow Solver"]
    AlgorithmRouter --> MSTBuilder["Kruskal's Minimum Spanning Tree"]
    AlgorithmRouter --> CentralityEngine["PageRank Authority & Centrality"]
    Pathfinder --> ExecutionPlan["Optimal Multi-Agent Execution Plan"]
    DAGAnalyzer --> ExecutionPlan
    FlowSolver --> ExecutionPlan
    MSTBuilder --> ExecutionPlan
    CentralityEngine --> ExecutionPlan

🚀 Quickstart & Standalone Execution

Local Python Client Usage

from client import MinimumSpanningTree

# Initialize engine
engine = MinimumSpanningTree()

# Execute self-testing benchmark suite
result = engine.benchmark_mst()
print("Execution Result:", result)

🔌 One-Click MCP Integration (Claude Desktop / Cursor)

Add to your claude_desktop_config.json or cursor.json:

{
  "mcpServers": {
    "genpark-minimum-spanning-tree-kruskal-prim-skill": {
      "command": "python",
      "args": ["-u", "/path/to/genpark-minimum-spanning-tree-kruskal-prim-skill/mcp_server.py"]
    }
  }
}

📦 Smithery.ai & PyPI Deployment

This skill contains pre-configured smithery.yaml and pyproject.toml manifests. Install directly via pip:

pip install git+https://github.com/alphaparkinc/genpark-minimum-spanning-tree-kruskal-prim-skill.git

Related MCP Connectors

Related MCP Servers

  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to run zero-dependency graph algorithms—including topological sorting, strongly connected component detection, shortest paths, maximum flow, minimum spanning trees, and PageRank—for agent dependency resolution and execution planning.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables agents to resolve dependencies and analyze directed graphs through topological sorting, strongly connected components, shortest paths, maximum flow, minimum spanning trees, and centrality ranking via MCP.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    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.
    7
    MIT