Skillget

genpark-dinics-max-flow-network-algorithm-skill

mcp
Security Audit
Warn
Health Warn
  • No license — Repository has no license file
  • Description — Repository has a description
  • Active repo — Last push 0 days ago
  • Low visibility — Only 7 GitHub stars
Code Pass
  • Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
  • Permissions — No dangerous permissions requested

No AI report is available for this listing yet.

SUMMARY

Dinic's blocking flow algorithm with level graphs and dead-end pruning for maximum network flow

README.md

Dinic's Max Flow Algorithm Skill

High-efficiency, zero-dependency Python implementation of Dinic's Maximum Flow Algorithm running in (O(V^2 E)) time.

Features

  • Level Graph Construction: BFS generates layered DAG structures to restrict search to shortest augmenting paths.
  • Blocking Flow Extraction: DFS pushes flow along active edges with dead-end pointer pruning.
  • Zero External Dependencies: Pure Python standard library.
  • Native MCP Protocol: JSON-RPC 2.0 stdio server compatible with Claude Desktop, Cursor, and Windsurf.

Architecture

graph LR
    Source["Source Node s"] --> BFS["BFS: Construct Level Graph"]
    BFS --> DFS["DFS: Push Blocking Flow along Layers"]
    DFS --> Check{"Sink Reachable in Residual Graph?"}
    Check -- Yes --> BFS
    Check -- No --> MaxFlow["Maximum Flow Achieved"]

Reviews (0)

No results found