Dijkstra algorithm interactive training software development for network analysis applications in GIS

Abstract

Process of route optimization is one of the basic applications of Network Analyses in Geographic Information Systems. In mathematical background of network analysis applications are graph theory and graph algorithms. Primary graph algorithm employed in process of route optimization is Dijkstra's Algorithm. Dijkstra's Algorithm is placed on the top of linear methods which yield exact solutions. Geographic Information Systems analyses such as the shortest route, the shortest duration and route with the least traffic are solved through Dijkstra's Algorithm. In this study, an interactive training software program, developed for educational use in Geographic Information Systems and Graph Theory classes at postgraduate degree, is introduced. This software provides students with the opportunity to use Dijkstra's Algorithm on graphs which they have designed by themselves and teaches details of algorithm, its working principles and structure of data to them, step by step, through interactive messages and graphics.