Minimum Spanning Trees

Loading...
查看授课大纲

审阅

3.4(127 个评分)
  • 5 stars
    44.88%
  • 4 stars
    11.81%
  • 3 stars
    7.08%
  • 2 stars
    12.59%
  • 1 star
    23.62%
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.

从本节课中
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.

教学方

  • Placeholder

    Dominik Scheder

    Assistant Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。