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
Greedy Algorithms
Graph Traversal (BFS & DFS)
Heaps & Priority Queues
Dijkstra's Algorithm
Kruskal's Algorithm
Prim's Algorithm
Dynamic Programming
Requires
Focus
Greedy Algorithms
Related
Next topics
A
Greedy Algorithms is dynamic programming's single-pass cousin — provably correct only when a locally-best choice can never block the global optimum. Activity Selection and Huffman coding qualify; 0/1 Knapsack and general Coin Change famously don't, which is exactly why those need Dynamic Programming instead.
Open topic →