1.1.2 Priority Queues

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set of records with numerical or otherwise totally ordered keys.

Problem: Build and maintain a data structures for quickly inserting and deleting records, while maintaining quick access to the smallest or largest key in the set.

Implementations

  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 9)
  • Handbook of Algorithms and Data Structures (Pascal) (rating 7)
  • SimPack/Sim++ Simulation Toolkit (C++) (rating 7)
  • Xtango and Polka Algorithm Animation Systems (C++) (rating 4)
  • Moret and Shapiro's Algorithms P to NP (Pascal) (rating 3)
  • Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 3)
  • The Stanford GraphBase (C) (rating 2)
  • DIMACS Implementation Challenges (FORTRAN) (rating 1)

    Related Problems

  • Dictionaries
  • Median and Selection
  • Shortest Path
  • Sorting

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .