genpark-minimum-spanning-tree-kruskal-prim-skill
mcp
Warn
Health Warn
- License — License: MIT
- Description — Repository has a description
- Active repo — Last push 0 days ago
- Low visibility — Only 7 GitHub stars
Code Pass
- Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
- Permissions — No dangerous permissions requested
No AI report is available for this listing yet.
Minimum Spanning Tree (MST) solver using Kruskal's disjoint-set union-find for optimal multi-agent communications backbones.
README.md
genpark-minimum-spanning-tree-kruskal-prim-skill
Production-Grade Graph Theory & Network Flow Agent Skill • 100% Standard Library Python • Native Model Context Protocol (MCP)
⚡ 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.
🏗️ 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
Maintained with ❤️ by GenPark AI Engineering • Powering Graph Intelligence in Autonomous Agents 🌍
Reviews (0)
Sign in to leave a review.
Leave a reviewNo results found