Add New Algorithm - Max Flow

[tientnc]

Is your feature request related to a problem? Please describe.
This request is about a new algorithm - Max Flow on a graph.

Describe the solution you'd like
There are a few algorithms for finding the Max Flow of a graph, from s to t, such as Ford-Fulkerson, Edmonds-Karp, Dinic, etc.

Describe alternatives you've considered
There are more algorithms, but the main ones are listed above.

Additional context
Thanks for your consideration!!

[aprameyak]

I’d like to work on this issue if it’s still open. Given the repo structure, I’m planning to add a Max Flow implementation under src/algorithms/graph/, starting with Dinic’s Algorithm in Java. I’ll keep the code so other algorithms like Edmonds–Karp can be added later if needed. Please let me know if this approach sounds good. Thanks!

[tientnc]

That sounds great. I would love to see your PR, and work with you if that's cool!

[aprameyak]

Sure I will send a pr when I am done.

[rootvikk]

Hi! Since @aprameyak is tackling Dinic's Algorithm, would it be alright if I work on adding Ford-Fulkerson or Edmonds-Karp alongside them?

[aprameyak]

Hi, my pr was accepted so you can probably see my changes in the main branch

[tientnc]

Hi all, it's nice to see the discussion. @rootvikk Please feel free to add new algorithms as you wish (Ford-Fulkerson, or Edmonds-Karp). @aprameyak It's great to see your implementation!