---
# System prepended metadata

title: Lecture 32 Setup/Prep
tags: [Setup]

---

---
tags: Setup
---

# Lecture 32 Setup/Prep

Today, we will continue looking at minimal spanning tree algorithms, focusing on two issues:

- what does one of these look like in code?
- how do we efficiently check whether adding an edge will create a cycle?

There's nothing to prep or download. We'll continue with the graph example from the last lecture.