Minimum Spanning Trees

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

Рецензии

3.4 (оценок: 127)
  • 5 stars
    44.88%
  • 4 stars
    11.81%
  • 3 stars
    7.08%
  • 2 stars
    12.59%
  • 1 star
    23.62%
NP
22 окт. 2017 г.

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

AG
4 дек. 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.

Преподаватели

  • Placeholder

    Dominik Scheder

    Assistant Professor

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

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