ConceptTheory & Algos
Priority queue
An abstract data type where elements have priorities associated with them and priorities change during execution.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Srini Devadas
Lectures that assume it
14The first 12 are shown.
- Uninformed Search
- Computational Objects
- Cache-Oblivious Structures I
- Sorting & Aggregation Algorithms
- Cache-Oblivious Algorithms: Searching & Sorting
- Retroactive Data Structures
- Geometric Structures II
- Dynamic Programming: All-Pairs Shortest Paths
- Search: Optimal, Branch and Bound, A*
- Greedy Algorithms: Minimum Spanning Tree
- Sorting in Linear Time
- Shortest Paths
Connections
23The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures16
- Priority Queues, Binary Heaps & O(n) Build-Max-Heap
- Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
- Uninformed Search
- Computational Objects
- Cache-Oblivious Structures I
- Sorting & Aggregation Algorithms
Show 10 moreShow fewer
- Cache-Oblivious Algorithms: Searching & Sorting
- Retroactive Data Structures
- Geometric Structures II
- Dynamic Programming: All-Pairs Shortest Paths
- Search: Optimal, Branch and Bound, A*
- Greedy Algorithms: Minimum Spanning Tree
- Sorting in Linear Time
- Shortest Paths
- Speeding up Dijkstra
- Sampling-based (kinodynamic) motion planning