[Feature Request]: Adding Edmonds-Karp Algorithm in Graph Algorithms

CodeHarborHub / codeharborhub.github.io

Welcome to CodeHarborHub! Our mission is to provide accessible and comprehensive educational resources to learners of all levels, from beginners to advanced professionals. Whether you're looking to kickstart your career in web development, master a new programming language, or stay updated on the latest tech trends, we've got you covered.

https://codeharborhub.github.io/

MIT License

80 stars 162 forks source link

[Feature Request]: Adding Edmonds-Karp Algorithm in Graph Algorithms #2913

Closed Santhosh-Siddhardha closed 3 months ago

Santhosh-Siddhardha commented 3 months ago

Is there an existing issue for this?

[X] I have searched the existing issues

Feature Description

Edmonds-Karp is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network using BFS.

Use Case

Network flow optimization. Matching in bipartite graphs.

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

[X] I have read the Contributing Guidelines
[X] I'm a GSSOC'24 contributor
[X] I have starred the repository

github-actions[bot] commented 3 months ago

Hi @Santhosh-Siddhardha! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

github-actions[bot] commented 3 months ago

Hello @Santhosh-Siddhardha! Your issue #2913 has been closed. Thank you for your contribution!