Geek Answers Handbook

HOT Queues (Heap On Top)

Can someone point me to an implementation example DISPLAY MAPPING or give some guidance on how to approach the implementation of one?

+7
c ++
source share
3 answers

Here is a page I found that gives at least a clue to the data structures you could use to implement this. Scroll down to the "Create A * Scalable" section. Unfortunately, academic articles mention the topic by writing C ++ code, but not providing any.

+2
source share

Here is a link to a document describing the hot queues. This is very abstract, why I wanted to see a coded example (I'm still trying to finish my way around it). http://www.star-lab.com/goldberg/pub/neci-tr-97-104.ps

The “cheapest” sorting option to say is a two-level heap queue (maybe this sounds more familiar). I would like to do this to improve the running time of the Dijkstra shortest path algorithm.

+1
source share

What I wanted to do was improve the working time of the Dijkstra shortest path algorithm.

Have you considered using the Boost Graph Library ? If you use your own implementation of the algorithm, you may have better results using the one that BGL provides .

However, it can be nontrivial to modify your code to work with BGL.

Of course, acceleration could be obtained without using Dijkstra at all, except for another algorithm.

+1
source share

More articles:


All Articles