Java Based Visulaization and Animation for Teaching The Dijkstra Shortest Path Algorithm in Transportation Networks
Ivan Makohon, Duc T. Nguyen, Masha Sosonkina, Yuzhong Shen, ManWo Ng · International Journal of Software Engineering & Applications · 2016
Shortest path (SP) algorithms, such as the popular Dijkstra algorithm has been considered as the "basic building blocks" for many advanced transportation network models.Dijkstra algorithm will find the shortest time (ST) and the corresponding SP to travel from a source node to a destination node. Applications of SP algorithms include real-time GPS and the Frank-Wolfe network equilibrium.For transportation engineering students, the Dijkstra algorithm is not easily understood.This paper discusses the design and development of a software that will help the students to fully understand the key components involved in the Dijkstra SP algorithm.The software presents an intuitive interface for generating transportation network nodes/links, and how the SP can be updated in each iteration.The software provides multiple visual representations of colour mapping and tabular display.The software can be executed in each single step or in continuous run, making it easy for students to understand the Dijkstra algorithm.Voice narratives in different languages (English, Chinese and Spanish) are available.A demo video of the Dijkstra Algorithm's animation and result can be viewed online from any web browser using the website: