Ford-Fulkerson Algorithm

Lakhankumawat / LearnCPP

Learn Cpp from Beginner to Advanced ✅ Practice 🎯 Code 💻 Repeat 🔁 One step solution for c++ beginners and cp enthusiasts.

https://lakhankumawat.github.io/LearnCPP/

MIT License

652 stars 492 forks source link

Ford-Fulkerson Algorithm #1429

Closed Pranshu321 closed 2 years ago

Pranshu321 commented 2 years ago

Description

In this, I will explain this graph-based algorithm Ford-Fulkerson algorithm which is a greedy approach for calculating the maximum possible flow in a network or a graph.

Well explained code with useful comments.
Well explained readme file,

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

[X] I follow Contributing Guidelines & Code of conduct of LearnCPP.

Pranshu321 commented 2 years ago

/assign

github-actions[bot] commented 2 years ago

Hello @Pranshu321, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.

github-actions[bot] commented 2 years ago

This issue has been assigned to Pranshu321! It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.