280,734 views 604 on YTPak
1,618 98

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.

Loading related videos...
(function(){ var spoutjs=document.createElement('script'),firstjs=document.getElementsByTagName('script')[0]; spoutjs.async=1; spoutjs.src='//cdn.spoutable.com/0f93c30c-199b-4e71-90dc-dbb5de72cee5/spoutable.js'; firstjs.parentNode.insertBefore(spoutjs,firstjs) })(); */ ?>