Prim's Algorithm - Step-by-Step Guide to Finding the Minimum Spanning Tree

In this video we will learn to find the Minimum Spanning Tree (MST) using Prim's Algorithm. Tutorial: https://goo.gl/aXLr4T Subscribe: http://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.