        | Lecture 5 - Page 25 : 39 |
| Notes about C++ Templates and The Standard Library |
|
|
| A priority queue example |
A priority queue is a heap We show an example of a priority queue of points, which is built on top of double-ended queue A priority queue relies on a comparison function - in our case the overloaded < operator in class Point A priority queue adapts an underlying container, defaulted to vector - we try a deque instead. |
|
|
|
|
