Minimal Spanning Tree - Prims Algorithm: Program using C++ STL
Channel: Akhilesh Kumar Srivastava
Date: 25/07/2022

#datastructure 
#graph 
#graphprogramming
#prims 
#minimalspanningtree
#directedgraph 
#programming #gate #ugcnet #universityexam #aktu 
#daa 
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.