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

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。