It works by finding a flow augmenting path in the graph. By adding the flow augmenting path to the flow already established in the graph, the maximum flow will be reached when no more flow augmenting paths can be found in the graph.
A variation of the Ford-Fulkerson algorithm is the Edmonds-Karp algorithm.
wikipedia.org dumped 2003-03-17 with terodump