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