HOT(Heap On Top) Queues
任何人都可以给我一个HOT Queue的示例实现，或者给出一些关于如何实现它的指针？
Here is a page I found that provides at least a clue toward what data structures you might use to implement this. Scroll down to the section called "Making A* Scalable." It's unfortunate that the academic papers on the subject mention having written C++ code but don't provide any.
Here is the link to the paper describing HOT queues. It's very abstract, that's why i wanted to see a coded example (I'm still trying to fin my way around it). http://www.star-lab.com/goldberg/pub/neci-tr-97-104.ps
The "cheapest", sort to speak variant of this is a two-level heap queue (maybe this sounds more familiar). What i wanted to do is to improve the running time of the Dijkstra's shortest path algorithm.
What i wanted to do is to improve the running time of the Dijkstra's shortest path algorithm.
Have you considered using the Boost Graph Library? If you are using your own implementation of the algorithm you might already get better results using the one the BGL provides.
However It might be nontrivial to modify your code so it works with the BGL.
Of course speed-up could also be gained by not using Dijkstra at all but another algorithm.
链接地址: http://www.djcxy.com/p/42236.html下一篇: HOT（堆顶）队列