Knowledge Graph
Navigate concepts visually
Click any node to re-center the graph around it. Solid nodes are mapped topics — dashed nodes are on the way.
Requires
Related
Next topics
Heaps & Priority Queues
Arrays
Binary Search Trees
Dijkstra's Algorithm
A* Search
Sorting Algorithms
Heap Sort Visualizer
Graph Traversal (BFS & DFS)
Greedy Algorithms
Requires
Focus
Heaps & Priority Queues
Related
Next topics
A
Heaps & Priority Queues is the structure behind every 'do the most urgent thing next' system — heap sort's own two phases are literally build-heap then repeatedly extract, and that same extract-min operation is exactly what Dijkstra's algorithm and A* need to pick the next node to visit.
Open topic →