Kruskal's MST Algorithm

Loading...
강의 계획서 보기

배우게 될 기술

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

검토

4.8(992개의 평가)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
AB

Apr 23, 2020

Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!

SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

강사:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.