In this project I have implemented most used shortest path algorithms (weighted and unweighted) in Graph Theory which can be visualized.
- Manually select a algorithm from the given list of most used algorithms.
- Draw random mazes and random weights.
- Source and destination can be dragged wherever needed.
- Change animation speed as needed.
- Visualize the algorithm