301,793 views 621 on YTPak
1,751 112

Published on 30 Mar 2014 | over 3 years ago

In this video we will learn to find the Minimum Spanning Tree (MST) using Prim's Algorithm.
Tutorial: goo.gl/aXLr4T
Subscribe: goo.gl/cFA9in

A spanning tree of a graph is a tree that has all the vertices of the graph connected by some edges.
A graph can have one or more number of spanning trees.
If the graph has N vertices then the spanning tree will have N-1 edges.
A minimum spanning tree (MST) is a spanning tree that has the minimum weight than all other spanning trees of the graph.
Customize Your Hybrid Embed Video Player!

6-digit hexadecimal color code without # symbol.

 

Report video function is under development.

 


Loading related videos...