Partial Selection Method and Algorithm for De-termining Graph-Based Traffic Routes in a Re-al-Time Environment
A.X.Nishanov1, E.Sh. Avazov2, B.B. Akbaraliyev3
1A.X.Nishanov, Department of Software Engineering, Tashkent University of Information Technologies Muhammad al-Khwarizmi, Uzbekistan.
2E.Sh. Avazov, Department of Telecommunication and Vocational Training, Urgench branch Tashkent University of Information Technologies named after Muhammad al-Khwarizmi, Uzbekistan.
3B.B. Akbaraliyev, Department of Software Engineering, Tashkent University of Information Technologies Muhammad al-Khwarizmi, Uzbekistan.
Manuscript received on 08 April 2019 | Revised Manuscript received on 15 April 2019 | Manuscript Published on 26 April 2019 | PP: 696-698 | Volume-8 Issue-6S April 2019 | Retrieval Number: F61530486S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper discussed how to determine traffic dependent traffic-oriented traffic in real-time. The partial selection method is presented in the algorithm. The main aspect of partial selection is that the focus is on selecting the graph widths on an informal basis. The developed algorithm is presented as pseudo code.
Keywords: Real Time Environment, Partial Selection, the Shortest Path Problem.
Scope of the Article: Software Engineering & Its Applications