Course contentsShow
Computer Science
Lesson 1017 of 2,87224. Minimum Spanning Trees and Network FlowPro lesson

Prim's Algorithm: Overview

Understand Prim's greedy approach to growing an MST from a starting vertex by adding minimum-weight edges to the tree.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.