Minimum Spanning Trees

video-placeholder
Loading...
Visualizar o programa do curso

Avaliações

3.4 (134 classificações)

  • 5 stars
    43,28%
  • 4 stars
    12,68%
  • 3 stars
    7,46%
  • 2 stars
    11,94%
  • 1 star
    24,62%

NP

22 de Out de 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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

AG

4 de Dez de 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

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

Na lição

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.

Ministrado por

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.