If every edge capacity is bounded by a constant, then the maximum flow must be bounded by $O(m)$. Thus, the Ford-Fulkerson algorithm would run in worst-case time $O(m^2)$.