Minimum Spanning Trees

video-placeholder
Loading...
View Syllabus

Reviews

3.3 (162 ratings)

  • 5 stars
    43.20%
  • 4 stars
    10.49%
  • 3 stars
    6.79%
  • 2 stars
    11.11%
  • 1 star
    28.39%

NP

Oct 22, 2017

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

AG

Dec 4, 2018

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

From the lesson

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.

Taught By

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.