A method is for solving the Maximum Flow Problem in a Flow Network.
The correctness of Ford-Fulkerson is based on the Max-Flow Min-Cut Theorem.
It is called a method rather than algorithm because it has several possible running times depending the path is found. An implementation of the Ford-Fulkerson method that use Breadth-First Search is the Edmonds-Karp Algorithm.
Pseudocode
where
c_f(u, v) = \begin{cases} c(u, v) - f(u, v) & \text{if } (u, v) \in E, \\\\ f(v, u) & \text{if } (v, u) \in E, \\\\ 0 & \text{otherwise.} \end{cases