Handling Ties [Advanced - Optional]

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
292 ratings
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

292 ratings
Course 3 of 4 in the Specialization Algorithms
From the lesson
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
Download on the App StoreGet it on Google Play