I made this project because of the importance of graphs and their algorithms and how easy they can be if visualised properly.
Initially on the grid you will see a start point and an end point. You can drag and drop the points anywhere on the grid. Each cell in the grid represents a node. You can modify the properties of a cell by either making it a wall or increasing it weight.
You can choose from the Algorithms that you want to visualise and then Visualise button will animate the path search procedure from start node to end node using the corresponding algorithm.
You can turn the grid into mazes obtained by different Algorithms like Recursive Backtracking or Kruskal's Algorithm or Prim's Algorithm and many others.
It is basically a canvas on which you can draw a graph of any kind you want. You can draw nodes and the connect the with edges. After that you can set start and end node and then select an algorithm to visualise the working of that algorithm. you can also visualize the working of Kruskal's Algorithm and Prims Algorithm for Minimum Spanning Tree.
