Added Edmonds-Karp Algorithm

[IkkiOcean]

📥 Pull Request

Description

This PR introduces the Edmonds-Karp Algorithm to the repository, a classic algorithm for solving the maximum flow problem in a flow network. It is an implementation of the Ford-Fulkerson method that leverages Breadth-First Search (BFS) to ensure polynomial time complexity, making it suitable for large-scale network flow problems.

Changes Made

• Included a edmonds-karp-algorithm.md entry describing the algorithm, its characteristics, time complexity, space complexity, approach and implementation in C++ and Java.

Closes #1791

Type of change

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• Documentation update

Checklist:

• My code follows the style guidelines of this project
• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

Screenshot

[github-actions]

Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊

[github-actions]

⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀

🔗 Site: Algo | Live Site

URL 🌐	Performance	Accessibility	Best Practices	SEO	📊
/algo/	🟡 55	🟢 96	🟡 71	🟡 86	📄
/algo/docs	🔴 49	🟢 96	🟡 75	🟢 100	📄
/algo/blog	🟡 67	🟢 92	🟢 96	🟡 86	📄

[ajay-dhangar]

Done

[github-actions]

🎉🎉 Thank you for your contribution! Your PR #1839 has been merged! 🎉🎉