Minimum Spanning Trees

Loading...
Visualizar o programa do curso

Avaliações

3.6 (101 classificações)
  • 5 stars
    50 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.

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

  • Dominik Scheder

    Dominik Scheder

    Assistant Professor

Explore nosso catálogo

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