Priority Queues

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. The std Priority Queue Interface
1.1. priority_queue is an Adapter
1.2. A Peek at the Implementation
1.3. Priority Queues via Ordered Insert
2. Applications of Priority Queues

Problem: Given a collection of elements that carry a numeric "score", find and remove the element with the smallest [largest] score. New elements may be added at any time.

This collection is called a priority queue because,


In the Forum:

(no threads at this time)