Minimum Spanning Trees

Loading...
来自 Shanghai Jiao Tong University 的课程
Discrete Mathematics
56 个评分
Shanghai Jiao Tong University
56 个评分
从本节课中
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.

与讲师见面

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

探索我们的目录

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