GRAPH ALGORITHM VISUALISER



Breadth First and Depth First Algorithms

A simple simulation of Breadth First Traversal and Depth First traversal on an undirected graph created by the user.

BFS and DFS


Dijkstra's Shortest Path Algorithm

A simulation of Djikstra's Shortest Path Algorithm and finding the shortest paths from the chosen source vertex to all the nodes.

Dijkstra's Algorithm


Kruskal's Minimal Spanning Tree

A simple simulation Kruskal's Algorithm for finding the Minimal Spanning Tree of a connected undirected weighted graph.

Kruskal's MST


Prim's Minimal Spanning Tree Algorithm

A simple simulation Prim's Algorithm for finding the Minimal Spanning Tree of a connected undirected weighted graph.

Prim's MST


The application is aimed to help the users better understand the famous algorithms on graph by visualizing the steps and realizing how the algorithm actually works. The graph is user generated and the edge weights of weighted graphs are randomly generated and can be changed by the click of a button.

For any query/sugesstion/feedback, mail at: pratimsarkar23@gmail.com