Implementation of Dijkstra Algorithm

[kishan-25]

Feature description : . I'm always frustrated when trying to find the shortest path in a graph, as the current methods are often inefficient and time-consuming.

Describe the solution you'd like I would like an implementation of Dijkstra's algorithm that can quickly and accurately compute the shortest path between nodes in a graph, providing clear outputs and visualizations to enhance understanding.

Describe alternatives you've considered I have considered using other shortest path algorithms like A* or Bellman-Ford, but they either lack efficiency in certain scenarios or do not fit my specific needs for handling weighted graphs effectively.

Additional context Dijkstra's algorithm is well-suited for graphs with non-negative weights and is widely used in applications like routing and navigation. A robust implementation could also include features like dynamic updates to the graph and interactive visualizations to show path finding in real time.

[fineanmol]

@kishan-25 Please Star ⭐️ the repo to earn 'hacktober-accepted' label for the event.\nMeanwhile, if you want to work on this issue, please raise a PR, and we will review and merge it.

[Kirtikaa25]

Please assign me this issue.

[Ghanshyam-07]

Hii @fineanmol,

I know  Implementation of Dijkstra Algorithm , please assingn me this under hacktoberfest-2024  so that i can appload the solution

thank you!

[Mustafa1765]

Hii @fineanmol recently i ve learned about Dijkstra algorithm ,can u please assign me this ill try to implement in the other way that i have learned