结果给出了相应的寻径算法。
寻径算法主要解决如何从图中寻找一条从起点到目标点的路径问题。
Path-Finding algorithms mainly solve how to find a path from the start point to the finish point on the map.
并行处理是计算机科学中最富有挑战性的领域之一，而并行计算机互联网和寻径算法则是这个领域中研究力量很集中的基础技术。
Parallel processing is one of the most challenging fields in computer science. Parallel computer interconnection networks and routing algorithms, however, are the basic techniques in this field.
应用推荐