基于迪杰斯特拉算法输入起点和终点和障碍物列表，规划出最短的路径-Based on the Dijkstra algorithm, enter the starting point and the end and the list of obstacles, and plan the shortest path

改进版的迪杰斯特拉算法，主要用于路径规划，效果良好(Improved version of the Dijkstra algorithm, mainly for path planning, the effect is good)

A*算法是一种静态路网中求解最短路径最有效直接的搜索方法，也是许多其他问题的常用启发式算法，他考虑了全局的信息，可以在一些情况下蜕化为迪杰斯特拉算法以及扫描时算法，本程序文件是利用A*算法进行一个航路规划(A * algorithm is a static road network to solve the shortest path is the most effective and direct search method, is also a lot of other problems c