CSSE 230: Session Notes - Day 25

Topics

  1. Minimum Spanning Tree
  2. Pell's algorithm
  3. Kruskal's algorithm

Outline

  1. [5 min] Minimum Spanning Tree
  2. [15 min] Solution approaches to solving MST problem
  3. [10 min] Correctness of solution approaches
  4. [10 min] Pell's algorithm and complexity
  5. [10 min] Kruskal's algorithm and complexity

Resources

Assignments

  1. Day 26, BC: Read sections 9.3 and 9.4