QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION

Abstract

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.