Video 91 of a series explaining the basic concepts of Data Structures and Algorithms. This video explains the working of the Prim's algorithm for finding minimum spanning tree. This video is meant for educational purposes only.
No one’s making infographic yet I wonder why. Or is it just not publicly available like the ones for the primary school students. Perhaps it’s time to make some for all usingAI?
Dear mam, you should continue doing more videos it really helps so much :) your explanation is very simple to understand and direct ready for exam thanks!
make two list, one for included vertices and another one for rest of the vertices put vertex a in included vertices list and find the adjacent vertex connected with a having minimum cost
