Minimum Spanning Trees

video-placeholder
Loading...
Visualiser le programme de cours

Avis

3.4 (134 évaluations)

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

NP

22 oct. 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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

AG

4 déc. 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

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

À partir de la leçon

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.

Enseigné par

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.