Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Prim's Algorithm: Minimal Spanning Tree

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
8,080
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on May 15, 2011

Prim's Algorithm is used to find a minimal spanning tree of a weighted graph. This videos shows you how to do it!

Category:

Education

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (11)

Sign In or Sign Up now to post a comment!
  • it helps me so much

    thank you

  • Great explanation! NOW I understood it. Thank you.

  • Thank you! I got an A on my test because of you!

  • amazing video!!! thanks a lot!

  • great teacher, great work!

    Thanks for the video.

    cheers from Argentina!

  • Thank you sooo much you explained really well, Thank you :)

  • Awesummm!!!!!!!

  • wow thanks, you explained this very very well! got it the first time round :)

  • cooool ........i dont even have to read this topic !!! it just got imprinted in my mind from ur lecture !!!!!!! thanks :)

  • Could have definitely done with you as my uni lecturer this year!

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more