33b: Graph Algorithms and Skepticism - Richard Buckland, UNSW

Loading...

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

Uploaded by on Jan 16, 2012

Lecture 33 of Computing2 - Data Structures and Algorithms. In this lecture we ask "How can we know if Prim's MST algorithm is correct?"

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (4)

Sign In or Sign Up now to post a comment!
  • "New Soth Wales" still in the ending credits.. has nobody else noticed? ;)

  • shy is it called a law if it's been proved, couldn't it be called theorem?

  • Spelt the title wrong.

  • Great teaching Richard, and great demonstration of disrespect by some students.

    I think 'shh' is the modern equivalent to a whack in the head with a thrown object,

    which I think some students still now really deserve.

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