The Unbounded Priority Queue
Part of the Springer Compass International book series (COMPASS)
Our final queue module presents the unbounded priority balking queue. As usual, the interface is covered in section 13.1 and the implementation follows in section 13.2.
KeywordsLoop Index Data Type Attribute Item Disposal Software Development Approach Head Link
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA 1986.Google Scholar
- G. Booch, Software Components in Ada Structures, Tools, and Subsystems, Benjamin/Cummings 1987, pp. 92–93, 142–153.Google Scholar
- G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London England 1984.Google Scholar
- K. John Gough, Writing Generic Utilities in Modula-2, Journal of Pascal, Ada, and Modula-2, Vol. 5(3), (May/June 1986 ), pp 53–62.Google Scholar
- D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addition-Wesley, Reading, MA 1973.Google Scholar
- T.A. Standish, Data Structure Techniques, Addison-Wesley 1980, Chapter 2: Stacks and Queues, pp. 20-23, 28–32.Google Scholar
- R.S. Wiener and G.A. Ford, Modula-2 A Software Development Approach, John Wiley & Sons 1985, pp. 247–253.Google Scholar
- R.S. Wiener and R.F. Sincovec, Data Structures Using Modula-2, John Wiley & Sons 1986, pp. 69–71.Google Scholar
© Springer-Verlag New York Inc. 1989