search

ajay-dhangar / algo

This repository contains a collection of data structures and algorithms implemented in various programming languages. It is designed to help learners understand key concepts through hands-on examples. Contributions and improvements are welcome!
https://ajay-dhangar.github.io/algo/
MIT License
55 stars 174 forks source link

[Feature Request] Curious to Add New Algorithm GRAPHS and shortest distance algorithms #200

Open praveenarjun opened 1 week ago

praveenarjun commented 1 week ago

🚀 Feature Request

Is your feature request related to a problem? Please describe.

I'm frustrated when the repository does not include comprehensive algorithms related to graphs and shortest distance algorithms. These are fundamental in many computer science applications and having them would greatly enhance the learning experience.

Describe the solution you'd like

I would like to add new algorithms related to graphs, including but not limited to:

Dijkstra's Algorithm for shortest path.
Bellman-Ford Algorithm.
Floyd-Warshall Algorithm.
Depth-First Search (DFS).
Breadth-First Search (BFS).

Describe alternatives you've considered

Other potential algorithms could include:

A* Algorithm.
Johnson’s Algorithm for All-pairs Shortest Paths.
However, I believe starting with the above-mentioned algorithms will provide a solid foundation.

Additional context

Adding these algorithms will provide learners with practical implementations of key graph and shortest path algorithms, enhancing their understanding of these critical concepts. Below is a flowchart illustrating how Dijkstra's algorithm works:

Would you like to work on this feature?

praveenarjun commented 1 week ago

give me labels like gssoc hackbefest