GenPark Distributed Deadlock Wait-For-Graph Detector
Real-time Tarjan SCC cycle detection on lock Wait-For-Graphs with victim transaction arbitrator
Install
Add this to your client's MCP configuration (Claude Desktop: claude_desktop_config.json; Cursor: .cursor/mcp.json; VS Code and others use the same "mcpServers" shape).
https://github.com/Alpha-Park/genpark-distributed-deadlock-wait-for-graph-detector-skill/releases/download/v1.0.1/genpark-distributed-deadlock-wait-for-graph-detector-skill.mcpbDocumentation
From the project's README on GitHub, refreshed weekly. Links open on GitHub.
genpark-distributed-deadlock-wait-for-graph-detector-skill
Real-time Tarjan SCC cycle detection on lock Wait-For-Graphs with minimal-cost victim transaction arbitrator
Quick Installation & MCP Integration
Add to your Claude Desktop or Cursor configuration:
{
"mcpServers": {
"genpark-distributed-deadlock-wait-for-graph-detector-skill": {
"command": "python",
"args": ["mcp_server.py"]
}
}
}
Zero Dependencies
Implemented entirely in Python 3 standard library.
Frequently asked questions
What is GenPark Distributed Deadlock Wait-For-Graph Detector?
Real-time Tarjan SCC cycle detection on lock Wait-For-Graphs with victim transaction arbitrator
How do I install GenPark Distributed Deadlock Wait-For-Graph Detector?
Follow the installation steps in its documentation, shown on this page and in its repository.
Does GenPark Distributed Deadlock Wait-For-Graph Detector need an API key?
Its registry entry lists no required key or secret. Some features may still need an account with the service it connects to.
Is GenPark Distributed Deadlock Wait-For-Graph Detector open source?
Its code is public on GitHub, but the repository does not declare a standard license.
Who maintains GenPark Distributed Deadlock Wait-For-Graph Detector?
It is published by alphaparkinc. AI.tn lists it but does not maintain or endorse it.
From the official MCP Registry. Listing is not an endorsement: review a server's code and permissions before giving it access to your data.