Watch, Follow, &
Connect with Us

For forums, blogs and more please visit our
Developer Tools Community.


ID: 17246, A Heap ADT (Priority Queue) Example in Delphi

by Justin Swett Email: Anonymous


Here's a heap written in Delphi. You can keep a min or max heap on anything you want. The only caveat is that you must provide a comparison function that can compare your heap items.
Download Details
FTP  download also available
CDN Login Required to Download. (You will be redirected to the login page if you click on the Download Link)
To download this, you must have registered:
A free membership

For Delphi, Version 4.0  to 6.0 472 downloads
Copyright: No significant restrictions


Size: 5,064 bytes
Updated on Fri, 04 Jan 2002 14:22:20 GMT
Originally uploaded on Fri, 04 Jan 2002 14:25:33 GMT
SHA1 Hash: 3AEDEFD32CCE3DA6D967C581ECFBC939775236DE
MD5 Hash: B9A2E41C6B36BC87F8E0C2D9D13DDCDA

    Explore the files in this upload

Description
Heaps are also know as priority queues since any element popped from the heap is guaranteed to be the "Greatest" or "Most Minimal" item in
the heap. It is this fact that lend heaps towards sorting. If you wanted to produce a sorted list of items you would pop off items until the heap was empty.

   Latest Comments  View All Add New

Move mouse over comment to see the full text

Could not retrieve comments. Please try again later.

Server Response from: ETNACDC03