maximum-flow
CommunityMaster max-flow proofs and reductions.
Software Engineering#graph-theory#max-flow#ford-fulkerson#edmonds-karp#min-cut#residual-network#network-flow
AuthorArcadi4
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This skill helps model, analyze, and certify max-flow problems, enabling correct maximum-flow outcomes, min-cut proofs, and robust network-flow reasoning in algorithms and implementations.
Core Features & Use Cases
- Model flow networks with sources, sinks, capacities, and conservation constraints
- Decide between Ford-Fulkerson, Edmonds-Karp, and scaling approaches
- Provide cut certificates, residual networks, and proofs of optimality
Quick Start
Transform your problem into a max-flow model and request an explicit certificate of optimality.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: maximum-flow Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#maximum-flow Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.