Lesson 12 of 20 · about 15 min
Paths, connectivity and trees
Can you get from here to there? You'll learn paths and cycles, find the separate pieces of a graph with code, and meet trees, the cheapest way to connect everything, which always use exactly one edge fewer than they have vertices.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Path and cycle
- Connected and components
- Tree
Free to try in F06 Discrete Math:
The first 3 lessons of every course are free, no account needed.