Minimum Spanning Trees

Loading...
Visualizar o programa do curso

Avaliações

3.4 (123 classificações)
  • 5 stars
    45.52%
  • 4 stars
    11.38%
  • 3 stars
    6.50%
  • 2 stars
    13%
  • 1 star
    23.57%
NP
22 de Out de 2017

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

AG
4 de Dez de 2018

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.