search

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
664 stars 493 forks source link

Bellman Ford Algorithm #1550

Closed psorat307 closed 2 years ago

psorat307 commented 2 years ago

Description

I would like to add Bellman Ford Algorithm. It's a popular graph algorithm used to calculate shortest path from source to all vertices when the graph contains negative edge weights. This algorithm is used when Dijkstra’s algorithm fails.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

github-actions[bot] commented 2 years ago

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

psorat307 commented 2 years ago

/assign

github-actions[bot] commented 2 years ago

This issue has been assigned to psorat307! 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.

github-actions[bot] commented 2 years ago

This issue is stale because it has been open 3 days with no activity. Remove stale label or comment or this will be closed in 2 days.

github-actions[bot] commented 2 years ago

This issue was closed because it has been stalled for 5 days with no activity. Please reopen this issue if not resolved.