Practical analysis of improving path searching efficiency by heap sort

With the development of computer technology,the method of path search algorithm has been widely used in many fields,and the higher request has been put forward for the searching time.To meet the requirement,based on artificial intelligence(Heuristic Search Methods A*),the method of heuristic search algorithm was adopted to improve searching efficiency,the search direction was adjusted dynamically by using network topology information and the algorithm was optimized to improve searching efficiency requirements by binary heap.Generally,the heuristic search algorithm is used for path search,its time complexity is O(n2)(n is the number of the network nodes),while dealing with the complicated network topology of millions of nodes,the searching time of heuristic search algorithm shows with exponential growth,so it does not meet the requirements of engineering technology.A good linearity of time is shown when the heuristic search algorithm of binary heap is applied for the long path and big search space through the theoretical analysis and experimental data,time complexity of this algorithm is O(log n)(n is the number of nodes Openlist).Meanwhile,there is no explosive growth in the searching time.So it meets the requirement of the higher performance and efficiency by using this algorithm,and has certain practical value for engineering practice.