EShoPPS: A computational tool to aid the teaching of Shortest Path algorithms

The development of a computational tool called eshopps – environment for shortest path problem solving,which is used to assist students in understanding the working of dijkstra,greedy search and a*(star) algorithms is presented in this paper. such algorithms are commonly taught in graduate and undergraduate courses of engineering and informatics and are used for solving many optimization problems that can be characterized as shortest path problem. the eshopps is an interactive tool that allows students to create a graph representing the problem and also helps in developing their knowledge of each specific algorithm. experiments performed with 155 students of undergraduate and graduate courses such as industrial engineering,computer science and information systems have shown that by using the eshopps tool students were able to improve their interpretation of investigated algorithms. © 2015,school of engineering,taylor’s university.