The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

- 学习>
- 计算机科学>
- 算法>
- Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 门课程>
- Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]

Loading...

Course video 28 of 53

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

#### Tim Roughgarden

Professor

课程、专项课程和在线学位均由全世界一流大学和教育机构的顶尖授课教师教授。

Join a **community** of **40 million learners** from around the world

Earn a skill-based **course certificate** to apply your knowledge