Minimum Spanning Trees

Loading...
Просмотреть программу курса

Рецензии

3.5 (оценок: 114)
  • 5 stars
    47%
  • 4 stars
    12%
  • 3 stars
    7%
  • 2 stars
    12%
  • 1 star
    21%
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

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.