知識點的復習筆記
阿新 • • 發佈：2018-11-14
not spa this min under there art partition fff
Chapter 5 Greedy Algorithm
5.1 Minimum spanning trees
Property 1: removing a cycle edge cannot disconnect a graph.
A tree is an undirected graph that is connected and acyclic.
Property 2: a tree on n nodes has n - 1 edges.
Property 3: any connected, undirected graph G = (V, E) with |E| = |V| - 1 is a tree.
Property 4: an undirected graph is a tree if and only if there is a unique path between any pair of nodes.
Cut property: suppose edges X are part of a minimum spanning tree of G. Pick any subset of nodes S for which X does not cross between S and V - S, and let e be the lightest edge across this partition. Then X U {e} is part of some MST.
Kruskal‘s algorithm:
知識點的復習筆記