CodeBase - Heap storage example

Return to the CodeBase listing

Category: Miscellaneous

Version: 1.0



Uploaded: 4th Sep 2003 14:02

Modified: 15th Sep 2003 08:16

Author:  IanM


Example of the Heap system used in the A* pathfinding routine

Full Description

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 /><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.