离散数学(四)概要1.pptVIP

§7.5 Minimum spanning trees (1) Prim(普里姆) P430 Procedure Prim(G:weighted connected undirected graph with n vertices) T:=a minimum-weight edge spanning tree in a for i=1 to n-2 begin e=an edge of minimum weight incident to a vertex in T and not forming a simple circuit in T if added to T T:=T with e added end {T is a minimum spanning tree of G} (1) Prim T={(a,d)} i=1; T={(a,d),(d,f)} i=2; T={(a,d),(d,f),(a,b)} i=3; T={(a,d),(d,f),(a,b),(b,e)} i=4; T={(a,d),(d,f),(a,b),(b,e),(e,c)} i=5; T={(a,d),(d,f),(a,b),(b,e),(e,c),(e,g)} W(T)=5+6+7+7+5+9=39 §7.5 Minimum spanning trees (2) Kruskal(克鲁斯卡尔) P432 Procedure Kruskal(G:weighted connected undirected graph with n vertices) T:=empty a minimum-weight edge spanning tree in a for i=1 to n-1 begin e=any edge in G with the smallest weight that does not form a simple circuit when added to T T:=T with e added end {T is a minimum spanning tree of G} (2) Kruskal T={} i=1;T={(a,d)} i=2;T={(a,d),(c,e)} i=3;T={(a,d),(c,e),(d,f)} i=4; T={(a,d),(c,e),(d,f),(a,b)} i=5; T={(a,d),(c,e),(d,f),(a,b),(b,e)} i=6; T={(a,d),(c,e),(d,f),(a,b),(b,e),(e,g)} W(T)=5+5+6+7+7+9=39 Discrete Mathematics Shandong University Qilu Software College Chapter 7 Trees §7.1 The concept of tree (1) （1）Trees Definition： A tree is a connected undirected graph with no simple circuits. parent, internal vertex,leaf vertex… (a) (b) (c) §7.1 The concept of tree (1) （1）Trees Theorem1 : An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. §7.1 The concept of tree (1) （1）Trees Theorem1-a If graph T(V,E) is TREE，the following Propositions are Logical equivalences(|V|=n, |E|=m). 1、T is TREE; 2、T is an undirected graph ，and every edge is cut edge； 3、T is connected，and m=n-1 ； 4、T has no circuit，and there is a unique simple path between any two of its vertices. §7.1 The concept of tree