这是我根据A*算法，通过javascr ipt实现的最短路径程序。可以说，程序非常糟糕，不过总算是实现了。思路是起点和终点的跑动过程中，我们中间可能会遇到障碍物，所以，我们不能仅仅是两点一直线，而是聪明的饶过障碍物进行聪明的跑动-This is my under the A* algorithm, through the javascr ipt to achieve the shortest path procedure. It can be said that the procedure is very bad, but is finally a reality. Idea is to start and end of the running process, we may encounter obstacles on the middle, so that we can not simply have two lines, but not executed clever clever obstacles to running