Minimum Spanning Trees

Loading...
Visualiser le programme de cours

Avis

3.4 (123 évaluations)
  • 5 stars
    45.52%
  • 4 stars
    11.38%
  • 3 stars
    6.50%
  • 2 stars
    13%
  • 1 star
    23.57%
NP
22 oct. 2017

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

AG
4 déc. 2018

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.