Add Dijkstra’s algorithm implementation in Python

[Harushii16]

🚀 Feature Request

Please add an implementation of Dijkstra’s shortest path algorithm in Python to this repository.

🔍 Why this is useful

• Dijkstra’s algorithm is a well-known graph algorithm and a useful example for learners.
• Having it in Python increases the variety of languages supported in this repo.
• Contributors can refer to it and extend with weighted graphs, test cases, etc.

📦 What to include

1. A file python/dijkstra.py (or under appropriate “Python” directory) with a clean, readable implementation.
2. Optionally, a README or comment block explaining usage (input format, how to call it, complexity).
3. A simple example/test case inside the same file or separate test_dijkstra.py or example in comments.
4. (Optional) Add entry in README.md listing “Python: dijkstra.py” under Python section or code index.

✅ Acceptance Criteria

• The algorithm handles graphs represented via adjacency lists or dictionaries.
• Works for non-negative weights.
• Example usage is documented.
• Code is clean, commented.
• Doesn’t break any existing contributions or project structure.

If maintainers are okay with this, I’ll prepare a PR with the implementation.

[studentpiyush]

Hi! 👋

I have created a Pull Request for this issue implementing Dijkstra's Algorithm in Python.

Please take a look at the PR when you have a chance: #2421

Thank you! 🙂

[sunidhi1dec]

i would like to work on this could you please assign it to me @Harushii16 ?

[Harushii16]

Hey , I am already working on this issue as I have raised it. Please work on another open issue or raise a one if you want to contribute

[studentpiyush]

Hey @Harushii16, thank you for confirming 😊
I’ve already submitted the PR (#2421) for this issue.
I’ll wait for your review.