Skip to main content
Glama
genpark-maximum-flow-edmonds-karp-network-skill

genpark-maximum-flow-edmonds-karp-network-skill

Official

genpark-maximum-flow-edmonds-karp-network-skill

Python 3.9+ License MIT MCP Compatible GenPark AI Zero Dependencies


⚡ Overview & Architectural Significance

genpark-maximum-flow-edmonds-karp-network-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 MaximumFlowSolver

# Initialize engine
engine = MaximumFlowSolver()

# Execute self-testing benchmark suite
result = engine.benchmark_max_flow()
print("Execution Result:", result)

🔌 One-Click MCP Integration (Claude Desktop / Cursor)

Add to your claude_desktop_config.json or cursor.json:

{
  "mcpServers": {
    "genpark-maximum-flow-edmonds-karp-network-skill": {
      "command": "python",
      "args": ["-u", "/path/to/genpark-maximum-flow-edmonds-karp-network-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-maximum-flow-edmonds-karp-network-skill.git

Related MCP Connectors

Related MCP Servers

  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables 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.
    7
    MIT
  • A
    license
    Not graded
    quality
    Not graded
    maintenance
    Enables 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.
    7
    MIT
  • A
    license
    Not graded
    quality
    Not graded
    maintenance
    Enables 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.
    7
    MIT