http://www.java3z.com/cwbwebhome/article/article2/2825.html
A*算法实现框架:
重要数据解释:
Open Table :存放所有已探知的但未搜索过点的优先队列。
Closed Table :存放搜索过的点的数组,提取最优路径时有用。
Start Node :起始点。
Target Node :终止点。
C Node :当前点。
算法框架如下:
1.Init start node , add it to open table
While not reach target node && open table is unNull
2.a) Get the head node in open table->c node
2.b) Finding all c node’s possible child node.
2.c) Calculate each child node’s f value.
2.d) Remove c node from open table , add it to closed table.
2.e) Add all c node’s child nodes to open table in an undescend sequence.
Wend
3.Ouput Search Result