Handling Ties [Advanced - Optional]

Loading...
Do curso por Universidade de Stanford
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
413 ratings
Universidade de Stanford
413 ratings
Curso 3 de 4 em Specialization Algorithms
Na lição
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Conheça os instrutores

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science