Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!hplabs!hpfcso!bigelow
From: bigelow@hpfcso.FC.HP.COM (Jim Bigelow)
Newsgroups: comp.lang.pascal
Subject: Re: Linked Queue implementation
Message-ID: <9110025@hpfcso.FC.HP.COM>
Date: 15 Mar 91 17:43:43 GMT
References: <26267@adm.brl.mil>
Organization: Hewlett-Packard, Fort Collins, CO, USA
Lines: 15

>         Does anyone happen to have the code handy for a linked-list
>        implementation of a priority-based queue in C or Pascal?

I recommend a min-heap rather then a link-list for a priority queue,
much faster.  You can see both the code and a nice description in
"Fundamentals of Data Structures iin Pascal", Horowitz and Sahni, 3rd
Edition  Computer Science Press, 1990.

Enjoy,

Jim Bigelow
HP9000/ S300 & S400 Pascal
Colorado Language Lab.
HP
Ft. Collins, CO