Find minimum residual capacity of the edhes along the path filled by BFS . Or we can say find the maximum flow through the path found .
int path_flow = int . MaxValue ; for ( v = t ; v != s ; v = parent [ v ] ) { u = parent [ v ] ; path_flow = Math . Min ( path_flow , rGraph [ u , v ] ) ; }