Understanding Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)
This video provides an in-depth exploration of Prim's Minimum Spanning Tree Algorithm, also known as Jarnik's Algorithm. It covers essential prerequisites, the underlying concept, a detailed outline, and a comprehensive running example to illustrate the a
Algorithms with Attitude
5.4K views • Jun 14, 2020
About this video
Table of Contents:
0:00 - Introduction and Prerequisites
0:25 - Idea
1:08 - Outline
1:57 - Running Example: 1st vertex with discussion
2:45 - Running Example: 2nd vertex with discussion
3:16 - Algorithm
5:03 - Running Example: Vertices 3-5
5:58 - Running Example: 6th vertex with discussion
7:15 - Running Example: 7th vertex with discussion
8:26 - Running Example: Remaining Graph
8:57 - Analysis
0:00 - Introduction and Prerequisites
0:25 - Idea
1:08 - Outline
1:57 - Running Example: 1st vertex with discussion
2:45 - Running Example: 2nd vertex with discussion
3:16 - Algorithm
5:03 - Running Example: Vertices 3-5
5:58 - Running Example: 6th vertex with discussion
7:15 - Running Example: 7th vertex with discussion
8:26 - Running Example: Remaining Graph
8:57 - Analysis
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
5.4K
Likes
61
Duration
9:50
Published
Jun 14, 2020
User Reviews
4.3
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.