Algorithm a specific implementation of Ford Fulkerson Algorithm that uses BFS to find augmenting paths in residual network (i.e. find path with shortest number of edges from source to sink) Time Complexity O(E²V)