genpark-graph-dijkstra-astar-pathfinder-skill
OfficialClick on "Deploy Server".
Wait a few minutes for the server to deploy. Once ready, it will show a "Started" state.
In the chat, type
@followed by the MCP server name and your instructions, e.g., "@genpark-graph-dijkstra-astar-pathfinder-skillFind the shortest path from A to F in a weighted graph with edges A-B:2, B-C:3, C-F:4."
That's it! The server will respond to your query, and you can continue using it as needed.
Here is a step-by-step guide with screenshots.
genpark-graph-dijkstra-astar-pathfinder-skill
⚡ Overview & Architectural Significance
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.
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 GraphPathfinder
# Initialize engine
engine = GraphPathfinder()
# Execute self-testing benchmark suite
result = engine.benchmark_pathfinder()
print("Execution Result:", result)🔌 One-Click MCP Integration (Claude Desktop / Cursor)
Add to your claude_desktop_config.json or cursor.json:
{
"mcpServers": {
"genpark-graph-dijkstra-astar-pathfinder-skill": {
"command": "python",
"args": ["-u", "/path/to/genpark-graph-dijkstra-astar-pathfinder-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-graph-dijkstra-astar-pathfinder-skill.gitThis server cannot be deployed
Maintenance
Related MCP Connectors
Workflow diagnostics, capability routing, and x402 settlement for MCP-compatible agents.
- geoOAuthco.thinair
Geocoding, routing, isochrones, traffic, weather, and place search for AI agents. 19 MCP tools.
AI Reasoning Cache & Consensus Layer with 11 MCP tools via Streamable HTTP.
Your saved nanoodle workflow graphs as MCP tools — BYOK or pay per call in Nano (x402)
Related MCP Servers
- AlicenseNot gradedqualityBmaintenanceEnables graph pathfinding and network analysis through MCP, including Dijkstra/A* shortest paths, topological dependency resolution, maximum flow, minimum spanning trees, and PageRank centrality for agent planning.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables 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.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables 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.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables 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.7MIT