[NEW ALGORITHM] Dijkstra's Algorithm

[suhasiniChoudhari]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

Dijkstra's algorithm under Graphs

About:

Dijkstra's algorithm is a popular algorithm for finding the shortest path from a single source vertex to all other vertices in a graph. It is widely used in routing and navigation systems.

[github-actions]

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

[Akanshaku]

I would like to work on this issue if it's still not done yet.