Application to Clustering

Loading...
From the course by 斯坦福大学
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
399 ratings
斯坦福大学
399 ratings
Course 3 of 4 in the Specialization Algorithms
From the lesson
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science