Recitation 21
From 6.006: Introduction to Algorithms
(Difference between revisions)
| Line 4: | Line 4: | ||
* We reviewed the heap as a priority queue, and how to implement it. | * We reviewed the heap as a priority queue, and how to implement it. | ||
* We described how to keep track of the indices of keys in a heap, so that Decrease-Key can run efficiently. | * We described how to keep track of the indices of keys in a heap, so that Decrease-Key can run efficiently. | ||
| + | . | ||
Revision as of 21:59, 30 January 2008
Highway Map Problem
- We discussed the interfaces in the provided code (nhpn.py).
- We reviewed the heap as a priority queue, and how to implement it.
- We described how to keep track of the indices of keys in a heap, so that Decrease-Key can run efficiently.
.
