Application: Internet Routing

Loading...
来自 Stanford University 的课程
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
595 个评分
Stanford University
595 个评分
课程 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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。