What are the differences between the Ford-Fulkerson and Edmonds-Karp algorithms for finding the maximum flow in a network?

The main difference between the Ford-Fulkerson and Edmonds-Karp algorithms is in how they choose the augmenting path to increase the flow in the network. Ford-Fulkerson uses any path from the source to the sink, while Edmonds-Karp always chooses the shortest path based on the number of edges. This makes Edmonds-Karp more efficient in finding the maximum flow in a network.