Login / Register

Prim's Algorithm for Minimum Spanning Trees Explained Step by Step

Thanks! Share it with your friends!


You disliked this video. Thanks for the feedback!

Sorry, only registred users can create playlists.

Added by Jason in Step by Step


In this video, we learn about Prim's Algorithm which is a very famous Greedy Algorithm used to find the minimum spanning tree (MST) of a given connected weighted undirected graph.

A minimum spanning tree (MST) is a spanning tree that has the minimum weight than all other spanning trees of the graph.

Topics covered in the video include-
Introduction to Prim's Algorithm and Kruskal's Algorithm
Steps for Implementing Prim's Algorithm
Problems illustrating the application of Prim's Algorithm on graphs

For details, please watch the video.

Catch us on Facebook by clicking the following link and liking the page :-

For any doubts/ queries, please comment below...

Please...Like, share and comment if you really gained something from this video and don't forget to subscribe yourself for getting the latest updates!

Your support really encourages us to do better....Thank you!! :)

All the best...Keep learning :)

Post your comment


Be the first to comment