Overview

Published

2023-08-06

Week 14: Minimum Spanning Trees; Prim’s Algorithm and Kruskal’s Algorithm

This week we’re going to learn how to solve the following problems:

  • Given a weighted, undirected graph, find the minimum weight tree that “spans” all nodes in the graph.

Learning Objectives

By the end of this module, you will be able to:

  • Find the minimum spanning tree of an arbitrary connected, weighted undirected graph.
  • Understand how to apply min heap and disjoint set find and union in implementing an algorithm for finding the minimum weight spanning tree of a graph.

To achieve this module’s objectives, please watch the introductory video (above), and complete the following:

  • Minimum Spanning Trees; Prim’s algorithm and Kruskal’s algorithm
  • Textbook, pp. 337-339

Review earlier material

In preparation for the final exam, you should review material from prior weeks. Exam will be comprehensive.

Original author: Clayton Cafiero < [given name] DOT [surname] AT uvm DOT edu >

No generative AI was used in producing this material. This was written the old-fashioned way.

All materials copyright © 2020–2023, The University of Vermont. All rights reserved.