Prim’s Algorithm for Minimum Spanning Tree with solved Example (urdu/hindi)

Prim’s algorithm is a greedy algorithm. It used to find the Minimum Spanning Tree (MST) from given weighted undirected graph. In this video Prim’s Algorithm for Minimum Spanning tree with solved Example has been explained in detail.To find out MST we need to apply following steps on given weighted graph.Step 1: Remove all loops Step 2: Remove all parallel edges between two Nodes (vertices) .In case of parallel edges, keep the one which has the least cost (weight)Step 3: Choose any arbitrary node as root node.Step 4: Check outgoing edges and select the one with less cost(weight) (repeat this step for all nodes) There should be no cycleprims algorithm in urduwhat is prims algorithmprim’s algorithm with examplePrim's Algorithm for finding Minimum Spanning tree in hindiPrim’s Algorithm for Minimum Spanning tree with solved Exampleprims algorithmprims algorithm in hindiprims algorithm time complexity#AZComputing#PrimsAlgorithm#MST