What is a 'Level Graph'?

What is a 'Level Graph'?

Approach: Define a subgraph used in Dinic's algorithm.

A subgraph where an edge exists between u and v only if the distance from source to v is the distance from source to u plus one. Used to find blocking flows.

Follow-up: What is the time complexity of Dinic's algorithm on a unit network?

Key concepts: bfs, shortest paths, dinic.