Heuristics for the A* using fewest hops
Question
I have a graph of nodes and I need to get from node a to node b. What is a good heuristic function (can be in pseudo code or anything) for getting from point A to point B. The information available is the adjacency of nodes and the distances between all nodes.
2 answers
solution1
0 2014-02-21 03:50:56
如果您具有所有节点之间的距离，那么这就是您可以拥有的最佳启发式方法。
solution2
-1 2013-03-18 19:02:14
Take a look at Dijkstra's algorithm
http://en.wikipedia.org/wiki/Dijkstra 's_algorithm
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Transform a sequence using the fewest number of steps possible
Generate any number in the fewest step using multiply by 2 or divide by 3?
Compute conditional probability using fewest for_loop, Matlab
Why using heuristics in an algorithm takes away asymptotic optimality?
How to generate an un-biased random number within an arbitrary range using the fewest bits
How to solve Travelling Salesman Problem with fixed start and endpoint using greedy heuristics?
Fewest number of turns heuristic
Shortest route with fewest turns
Fewest bytes to identify a file
A star algorithm: Distance heuristics
Related Tags