寻路在计算机进程里，是两点之间的最佳路径，比迷路园更加现实。

运算法则

常见的例子是A*搜寻算法。这个法则开始为一个点，添加所有可以到达的点到一个开放列表

Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding a shortest path on a weighted graph.