Generic Algorithm for MS'T Problem Input:G:a connected,undirected graph w:a function from IG to the set of real number Generic-MST(G,w) 1A←-0 2 while 4 does not form a spanning tree 3 do find an smallest edge (u,v)that is safe for 4 4 A←-AU{(u,)} 5 return 4 Output:a minimal spanning tree of GGeneric Algorithm for MST Problem Generic-MST(G,w) 1 A0 2 while A does not form a spanning tree 3 do find an smallest edge (u,v) that is safe for A 4 AA{(u,v)} 5 return A Input: G: a connected, undirected graph w: a function from VG to the set of real number Output: a minimal spanning tree of G