Mathematical Characterization of the Dijkstra Algorithm to Handle the Turntable

This article analyzes and shows the mathematical characterization necessary to implement the turn table and achieve the search for the optimal route by means of the Dijkstra algorithm, this analysis supports the development of the research "Design and Development of a Framework for the Network Analysis in GIS Tools, implementing the Dijkstra Algorithm that supports the Impedance of Turns ”. In this work we can see how it is possible to transform a network to a system of graphs or weighted digraphs and the transformation process that these graphs must undergo in order to implement the impedances or restrictions of turns. All the mathematical development presented here constitutes the first step for the development of multiple and future network analysis projects in GIS applications