静态地图搜索算法通常分为盲目搜索算法和启发式搜索算法。最经典的盲目搜索

静态地图搜索算法通常分为盲目搜索算法和启发式搜索算法。最经典的盲目搜索算法是Dijkstra 算法，非常适合在带权有向图中求解最短路径问题，但是由于Dijkstra算法的搜索范围很大，算法效率比较低，因此在实际应用时受到了很大的限制[4]。随着经典图论和计算机技术的不断完善和发展，尤其是在数据结构与算法方面的创新促进了新的最短路径算法的涌现。

結果 (英文) 1:

Static map search algorithm is usually divided into blind search algorithms and heuristic search algorithms. The classic blind search algorithm is Dijkstra algorithm is a good choice for solving shortest path problem in weighted directed graphs, but due to Dijkstra algorithm to search over a large, the algorithm is less effective and therefore has been greatly restricted in practical application [4]. Classic graph theory and the improvement and development of computer technology, especially innovations in data structures and algorithms facilitating the emergence of new shortest path algorithm.

結果 (英文) 2:

Static map search algorithm is usually divided into blind search algorithms and heuristic search algorithm. The most classic blind search algorithm Dijkstra algorithm is very suitable in a weighted shortest path problem solving directed graph, but due to a large range Dijkstra algorithm search algorithm efficiency is relatively low, so in practical applications has been greatly restricted [4]. With the continuous improvement and development of classical graph theory and computer technology, especially in innovative data structures and algorithms aspects of promoting a new shortest path algorithm to emerge.

結果 (英文) 3:

Static map algorithms are usually divided into blind search and heuristic search algorithm. Blind search algorithm is the most classical Dijkstra algorithm, very suitable for solving the shortest path problem in directed graph in weighted, however due to the large search range of Dijkstra algorithm, the algorithm efficiency is relatively low, so in practical application is limited to [4] great. With the development and improvement of the classical graph theory and computer technology, especially the innovation in data structure and algorithm in terms of promoting the new shortest path algorithm to emerge.