Spanning Tree & Minimum Spanning Tree Introduction with Examples (urdu/hindi)

Spanning tree for a graph G (V,E ), is a subgraph of G which contains all the vertices of G.We may also say, spanning tree (S) is connected subgraph of Graph (G) if: ‘S’ should contain all vertices of G and ‘S’ should contain (|V|-1) edges. In this lecture basic introduction of Spanning Tree & Minimum Spanning Tree has been discussed with help of examples. How to draw a spanning tree and how to find minimum spanning tree has also been explained in this tutorial.Multiple spanning trees can be constructed from a single graph. To find out how many spanning trees can be constructed from single graph, we can use following formula:No. of spanning trees = n ^n-2 ( where ‘n’ is number of vertices in Graph )Above formula can only be use if we have complete graph otherwise we use Kirchhoff's theorem)complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge OR we can use following formula to check that graph is complete or not:V(V-1)/2 edgesSpanning TreeMinimum Spanning TreeSpanning Tree & Minimum Spanning Tree how to calculate minimum spanning treehow to draw spanning treewhat is spanning treeSpanning Tree in urduMinimum Spanning Tree in urduSpanning Tree & Minimum Spanning Tree in urdu#AZComputing#SpanningTree#MinSpanningTree