Add Ford-Fulkerson Algorithm for Maximum Flow Calculation

[Vatsalya-24]

Added an implementation of the Ford-Fulkerson algorithm for calculating the maximum flow in a network.

[alxkm]

To start review you need to address the build and checkstyle issues, which you can find here:

https://github.com/TheAlgorithms/Java/actions/runs/10437419630/job/28903590101?pr=5341
https://github.com/TheAlgorithms/Java/actions/runs/10437419631/job/28903590065?pr=5341
https://github.com/TheAlgorithms/Java/actions/runs/10437419623/job/28903590072?pr=5341

After that, we can begin the code review. It's also important to note that a similar algorithm implementation already exists in com.thealgorithms.dynamicprogramming. To verify the algorithm's correctness, you'll need to write some tests, as it's not clear whether the current implementation is accurate.

[github-actions]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!