Understanding Prim's Minimum Spanning Tree Algorithm
A clear and concise explanation of Prim's algorithm for determining the Minimum Spanning Tree (MST) of an undirected weighted graph.
AlgoCoda
21 views • Nov 15, 2019
About this video
A simple explanation of Prim's algorithm to find the MST of an undirected weighted graph.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
21
Likes
1
Duration
11:16
Published
Nov 15, 2019
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now