Graph pathfinding engine implementing Dijkstra's shortest path and A* heuristic routing with priority queues for agent planning.
genpark-graph-dijkstra-astar-pathfinder-skill
Production-Grade Graph Theory & Network Flow Agent Skill • 100% Standard Library Python • Native Model Context Protocol (MCP)
genpark-graph-dijkstra-astar-pathfinder-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
🔌 One-Click MCP Integration (Claude Desktop / Cursor)
Add to your claudedesktopconfig.json or cursor.json:
This skill contains pre-configured smithery.yaml and pyproject.toml manifests. Install directly via pip:
Maintained with ❤️ by GenPark AI Engineering • Powering Graph Intelligence in Autonomous Agents 🌍
From the project README.
Add the radar badge to your README — it shows your project was picked up by MCP Radar and links to this page:
[](https://mcp.liqiwa.com/s/alphaparkinc--genpark-graph-dijkstra-astar-pathfinder-skill.html)
Minimum Spanning Tree (MST) solver using Kruskal's disjoint-set union-find for optimal multi-agent communications backbones.
Alpha-Park/genpark-maximum-flow-edmonds-karp-network-skillEdmonds-Karp network flow engine with BFS augmenting paths computing maximum flow and minimum cut bottlenecks for multi-agent routing.
alphaparkinc/genpark-speculative-decoding-verifier-skillDraft-target model speculative decoding verification engine with rejection sampling, acceptance rate telemetry, and dynamic speedup ratio estimation.
Alpha-Park/genpark-speculative-decoding-verifier-skillDraft-target model speculative decoding verification engine with rejection sampling, acceptance rate telemetry, and dynamic speedup ratio estimation.
Alpha-Park/genpark-dynamic-prompt-prefix-cache-skillRadix trie-based prompt prefix cache optimizer matching longest common prompt token prefixes to eliminate redundant prefill computation and reduce TTFT.
Alpha-Park/genpark-yield-curve-nelson-siegel-interpolator-skillNelson-Siegel parametric zero-coupon yield curve modeling engine fitting spot rates, decay factor, level, slope, and curvature components.
The top new MCP servers of the week, every Monday. No spam, unsubscribe anytime.