Keep distance to the vertex in the layered network.
bfs considers only edges with non-zero residual capacity.
bfs indicates if sink could be reached
dfsPath function to find an augmenting path in layered network.
removeLastEdge returns the edge
graphEdge.isSaturated
Fix augPath methods that mutate the path.
Complete Dinic algorithm.