Computer Graphics, Semester 4
CG-Pathfinder (Dijkstra’s & A* Search Visualiser), is a visual representation of how shortest path search algorithms works behind the scene. The input for the project is a weighted undirected graph. We also input the source node where we’d like the algorithm to find the shortest path to all the other nodes and in the end display the path to the destination node. This algorithm has various applications like shortest path finding, cycle detection in a graph etc.
The intro page
Entering the graph inputs
Displaying the entered graph
Graph getting processed
Output with the shortest path