Skip to main content

Bounded Priority Queue

  • Chapter
  • 38 Accesses

Part of the book series: Springer Compass International ((COMPASS))

Abstract

Two different implementations of the bounded priority queue are given in this chapter. The first is a simple extension to the basic bounded queue of chapter 10 that allows an item’s priority to dictate the ordering of its arrival. This is covered in sections 12.1 and 12.2. In the second implementation, section 12.3, the structural ordering of items follows different rules; specifically those imposing a heap structure on the array of items.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.

    MATH  Google Scholar 

  2. J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA 1986.

    Google Scholar 

  3. G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.

    Google Scholar 

  4. K. Christian, A Guide to Modula-2, Springer-Verlag, New York, NY 1986.

    MATH  Google Scholar 

  5. G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London England, 1984.

    Google Scholar 

  6. D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.

    Google Scholar 

  7. B. Liskov and J. Guttag, Abstraction and Specification in Program Development, The MIT Press, Cambridge, MA 1986.

    MATH  Google Scholar 

  8. J.J. Martin, Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.

    MATH  Google Scholar 

  9. T.A. Standish, Data Structure Techniques, Addison-Wesley, Reading, MA 1980.

    Google Scholar 

  10. R. Wiener and G. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985.

    Google Scholar 

  11. R. Wiener and R. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986.

    Google Scholar 

  12. N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.

    MATH  Google Scholar 

  13. N. Wirth, Programming in Modula-2, 3rd. corrected edition, Springer-Verlag, New York, NY 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Lins, C. (1989). Bounded Priority Queue. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6396-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-6396-5_13

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-6398-9

  • Online ISBN: 978-1-4684-6396-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics