Minimum Spanning Trees

Loading...
シラバスを表示

レビュー

3.5 (119 件の評価)
  • 5 stars
    46.21%
  • 4 stars
    11.76%
  • 3 stars
    6.72%
  • 2 stars
    11.76%
  • 1 star
    23.52%
NP

Oct 23, 2017

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

AG

Dec 05, 2018

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.

講師

  • Dominik Scheder

    Dominik Scheder

    Assistant Professor

コース一覧で検討

サインアップは無料です。今すぐサインアップして、パーソナライズされたお勧め、更新、サービスを利用しましょう。