An approach to finding the most optimal route in a dynamic graph
Akhram Khasanovich NishanovTashkent university of Information Technologies named after Muhammad al-Khwarizmi,Department of systematic and practical programming,Tashkent,UzbekistanOybek AllamovUrgench branch of Tashkent university of Information Technologies named after Muhammad al-Khwarizmi,Department of Software engineering,Urgench,Khorezm region,UzbekistanOrtiq Bakhtiyorovich RuzibaevDean of Software enginering Tashkent university of Information Technologies named after Muhammad al-Khwarizmi,Tashkent,UzbekistanAnvar Shukhratbekovich AbdullaevUrgench branch of Tashkent university of Information Technologies named after Muhammad al-Khwarizmi,Department of Software engineering,Urgench,Khorezm region,UzbekistanShakhlo AllamovaUrgench branch of Tashkent university of Information Technologies named after Muhammad al-Khwarizmi,Department of Software engineering,Urgench,Khorezm region,Uzbekistan
2021 International Conference on Information Science and Communications Technologies (ICISCT)conference2021en
ABI
Аннотация
The article proposes an algorithm for determining the optimal ways for users to travel from one place to another. Traffic jams occur in cities as a result of road repairs and car accidents. As a result, the shortest route planned for the trip can become a useless route. Given these circumstances, the article presents a parallel processing method distributed on a large-scale graph to control traffic. As a result, an algorithm for parallel and distributed processing of large-volume graphs was developed and tested for large-volume data. The test algorithm is illustrated with a wide range of graphs. Experimental experiments of the algorithm were conducted on the basis of data from the city of Urgench, Uzbekistan.
Ҳали таржима қилинмаган