Autor: |
M. P. Revotjuk, M. K. Qaraleh, N. V. Khajynova |
Jazyk: |
ruština |
Rok vydání: |
2019 |
Předmět: |
|
Zdroj: |
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 4, Pp 73-79 (2019) |
Druh dokumentu: |
article |
ISSN: |
1729-7648 |
Popis: |
On the classical problem of searching the shortest paths in graphs considered the possibility of accelerating the search procedure by incorporating a priori information about the search space. Global initialization of state variables predefined search and selection solutions can improve performance of multiple procedures to find paths to a linear dependence on the volume of the scanned area. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|