Minimum Spanning Trees

video-placeholder
Loading...
강의 계획표 보기

검토

3.3개(162개 평가)

  • 5 stars
    43.20%
  • 4 stars
    10.49%
  • 3 stars
    6.79%
  • 2 stars
    11.11%
  • 1 star
    28.39%

NP

2017년 10월 22일

Fantastic course. Fascinating material, presented at a reasonably fast pace, and some really challenging assignments.

AG

2018년 12월 4일

This course is good to comprehend relation, function and combinations.

수업에서

Spanning Trees

We discuss spanning trees of graphs. In particular we present Kruskal's algorithm for finding the minimum spanning tree of a graph with edge costs. We prove Cayley's formula, stating that the complete graph on n vertices has n^(n-2) spanning trees.

강사:

  • Placeholder

    Dominik Scheder

    Assistant Professor

Coursera 카탈로그 살펴보기

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