资 源 简 介
/* 求解最短路径代码 * 这段代码没有进行任何优化(包括算法上的), 但不意味我不知道该怎样优化它, * 它是为教学目的而做,旨在用易于理解和简洁的代码描述出 A* 算法在求最段路 * 径中的运用. 由于很久没有摸算法书, 本程序不能保证是纯正的 A* 算法 -) * 你可以在理解了这段程序的基础上,按自己的理解写出类似的代码. * * 本程序附带有一个数据文件 map.dat, 保存有地图的数据 */-/* code for the Shortest Path* This code without any optimization (algorithm), but does not mean that I do not know how to optimize it,* it is for the purpose of instruction and so, easy to use and simple to understand code describes the A* algorithm for most of the Road* path use. As long without feeling algorithm, the procedure is no guarantee that the tradition of A* algorithm-)* You can understand this process on the basis of their own understanding to write a similar code.* The procedure is an ancillary data files map.dat preserve land The data* /