[Code Addition Request]: Dijkstra Algorithm Visualizer
Have you completed your first issue?
- [X] I have completed my first issue
Guidelines
- [X] I have read the guidelines
- [X] I have the link to my latest merged PR
Latest Merged PR Link
https://github.com/ChiragAgg5k/cal-buddy/pull/8
Project Description
This Python project provides a visual representation of Dijkstra's algorithm on a graph. It allows users to input the number of nodes, specify the nodes, input the edges with weights, and choose a starting node. The script then visualizes the shortest distances and paths from the chosen starting node using networkx and matplotlib.
Full Name
Anantesh G
Participant Role
GSSoC, Hacktoberfest
🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.
Feel free to join our community on Discord to discuss more!
@UTSAVS26 Kind request to add level2 label for this project. Reason being this is an advanced python project with visualization.
@UTSAVS26 Kind request to add level2 label for this project. Reason being this is an advanced python project with visualization.
I can only add level2 or above levels to those issues which are solving bugs or adding new feature in the existing codebase not just the code.
Ok no problem!
✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!
✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!