genpark-topological-sorter-tarjan-scc-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-topological-sorter-tarjan-scc-skilltopologically sort my agent tasks: A->B, A->C, B->D, C->D"
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-topological-sorter-tarjan-scc-skill
⚡ Overview & Architectural Significance
genpark-topological-sorter-tarjan-scc-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-graph-dijkstra-astar-pathfinder-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 GraphDAGAnalyzer
# Initialize engine
engine = GraphDAGAnalyzer()
# Execute self-testing benchmark suite
result = engine.benchmark_topological_analysis()
print("Execution Result:", result)🔌 One-Click MCP Integration (Claude Desktop / Cursor)
Add to your claude_desktop_config.json or cursor.json:
{
"mcpServers": {
"genpark-topological-sorter-tarjan-scc-skill": {
"command": "python",
"args": ["-u", "/path/to/genpark-topological-sorter-tarjan-scc-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-topological-sorter-tarjan-scc-skill.gitThis server cannot be deployed
Maintenance
Related MCP Connectors
Hosted code graph over MCP: exact callers, dependencies, and cross-repo blast radius for AI agents.
MCP facade over the Nebelus Construction API. ~48 tools give full agent build parity: create/update/probe agents, edit graphs, attach knowledge and vector stores, wire connectors, set governance policies and locked guardrails, enable grounding-trace, and read deployment wiring. Purpose-built for regulated industries: data residency is enforced per region (EU / GCC-KSA), with PII controls and an audit trail. Agents are created as drafts — no deploy tool is exposed over MCP by design; publishing happens in the Nebelus console.
Governed AI agent skills — one library, distributed to devs and exposed to remote agents over MCP.
Governed data discovery, exact queries, decisions, simulations, and runtime utilities over MCP.
Related MCP Servers
- AlicenseNot gradedqualityBmaintenanceEnables agents to compute shortest paths with Dijkstra and A*, resolve DAG dependencies, solve maximum flow, build minimum spanning trees, and rank graph centrality using JSON-RPC MCP tools.7MIT
- 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 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 orderings, maximum flow and minimum cut bottlenecks, minimum spanning trees, and centrality rankings for graph-based multi-agent routing. It runs as a zero-dependency MCP server using standard Python libraries.7MIT