Deployed Link(https://abhishek090802.github.io/VisMaster/)

It is an sorting and path finding visulizer which demonstrates the animated working of the well known path finding aolgorithms like dijkstra's,Depth first search(DFS),breadth first search(BFS),Greedy best first search assuming an 2-D grid as an graph with ant specific source and destination you can also add maze as an obstackle in the grid there were seversal choice among it as well also.

Vismaster also has the functionality of the sorting visulizer in which by selecting any random array you can visulize insertion,selection,bubble,merge.bucket sort with graphical animations you can also modify the speed according to your comfort.