Minimum Spanning Trees

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

Рецензии

3.5 (оценок: 98)
  • 5 stars
    47 ratings
  • 4 stars
    13 ratings
  • 3 stars
    5 ratings
  • 2 stars
    11 ratings
  • 1 star
    22 ratings
AG

Dec 05, 2018

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

MY

Aug 09, 2017

Short course!! I use it to review my discrete math knowledge.

Из урока
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

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

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