Add Ford-Fulkerson Algorithm for Maximum Flow Calculation #5341
Conversation
|
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 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. |
|
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! |
|
Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution! |
Added an implementation of the Ford-Fulkerson algorithm for calculating the maximum flow in a network.