Example: Visualization of Dijkstra Shortest Path Algorithm

 

Following Java Applet used Assisting Visualization Framework to visualize classic dijkstra algorithm. Vertex is generated randomly with its 3D space coordinates, and weights of edges between them are measured using their euclidean distances. During the search process, if a vertex is in close list, then its color become purple. Whenever an edge is updated then its visualized as thickend line. The shortest path tree is visualized as blue thickened lines. And in the end, the shortest path is highlighted.

Source File