Problem Definition

Loading...
來自 Stanford University 的課程
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
514 個評分
Stanford University
514 個評分
課程 3(共 4 門,Specialization Algorithms
從本節課中
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

與講師見面

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。