# Dinic Blocking Flow Layered Network: Study Guide
Dinic Blocking Flow Layered Network shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS builds level graphs from residual capacities, then DFS sends blocking flow along admissible edges until no more augmenting path stays inside the levels.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(V^2 E) on general graphs, O(min(V^{2/3}, E^{1/2}) E) on unit networks.
## Common mistake
Reusing an old level graph after a blocking-flow round instead of rebuilding it.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at best AI tool for coding tests and OAs.