Lecture 33

Minimum Spanning Tree

Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Tree: A Connected Acyclic Graph
  2. Spanning Tree
  3. Minimum Spanning Tree
  4. Prim's Algorithm: Description
  5. Prim's Algorithm: Exercise
  6. Prim's Algorithm: Analysis
  7. Kruskal's Algorithm: Description
  8. Kruskal's Algorithm: Exercise
  9. Kruskal's Algorithm: Analysis

Lessons marked with ⚡ contain exercise/activity.