Dijkstra's algorithm and graph theory as an approach to analyze the Syrian regional transportation system
Abstract
Dijkstra's algorithm and graph theory as an approach to analyze the Syrian regional transportation system
Incoming article date: 28.06.2023Based on the need to develop the transport network between the regions of Syria, to support the development process, first of all, it was necessary to evaluate the efficiency of the existing network, the degree of its connectivity, the centralization of its nodes and the efficiency of access to it, in order to propose new axes of transport and development that improve the efficiency of the transport network. Summary mathematical indicators of the proposed solution are given on the basis of graph theory and Dijkstra's algorithm, as well as other indicators, in addition to the works of N.A. Ermoshin and K.L. Komarov, which emphasize the priority of construction of motor roads and public road facilities of regional and intermunicipal significance, taking into account the socially significant economic effect. The obtained results confirmed the need to develop the transportation framework of Syria to increase the level of connectivity between its regions.
Keywords: regional planning, development, Syrian desert region, transportation framework, accessibility, graph theory, Dijkstra's algorithm