Comparing worst-case time complexities.
Edmonds-Karp: O(V * E²)
Improves on Ford-Fulkerson by using BFS to find shortest augmenting paths.
Push-Relabel: O(V² * E)
A different approach that "pushes" flow locally. With FIFO selection, improves to O(V³).
Edges (E) = ~148