✨[FEATURE] Add Dijkstra Visualizer

[AnanteshG]

🌟 Feature Overview

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.

🤔 Why this feature?

This feature would be incredibly helpful for:

• Education: Helping students and developers understand how Dijkstra's algorithm works visually.
• Debugging and Analysis: Allowing users to visualize their graph data and paths, making it easier to verify that the shortest path and distances are computed correctly.
• User Interaction: Providing an intuitive and interactive way for users to learn or apply Dijkstra’s algorithm on their own custom input, making the program more engaging and practical.

📋 Expected Behavior

The project should:

• Input the number of nodes and edges.
• Input the edges between nodes and their corresponding weights.
• Choose a starting node from which the shortest paths will be calculated.

🖼️ Example/Mockups

📝 Additional Details

Add any other details or suggestions.