CodeBase - Heap storage example
Uploaded: 4th Sep 2003 14:02
Modified: 15th Sep 2003 08:16
Example of the Heap system used in the A* pathfinding routine
Heaps are a quick and easy way to organise data to allow you to retrieve that data in sequence without keeping the data completely sorted.<br /> <br /> You can find a description of how a heap is arranged and modified here :<br /> http://webpub.alleg.edu/student/g/groganb/heap_text.html<br /> <br /> There is a difference though ... I have reversed mine so that the lowest value is held at the top of the tree.
No comments yet.