正在加载图片...
CONNECTED-COMPONENTS(G) 1 for each vertex v∈G.V b 2 MAKE-SET(V) 3 for each edge (u,v)EG.E 4 if FIND-SET()FIND-SET(v) 5 UNION(u,V) SAME-COMPONENT(,V) 1 if FIND-SET()==FIND-SET(v) 2 return TRUE 3 else return FALSE Edge processed Collection of disjoint sets initial sets {a} {b} {c} d) {e} 份 {g} (h) (i } (b.d0 La) (b.d} {c} Le) 仍 {8} (h) i (e,g) {a} {b,d) {c} {e,g} (h; Ad } (a,c) {a,c} {b.dy {e,g} 份 {h) 》 (h,i0 {a,c} {b,d0 {e,g} {h,} } (a,b) a.b.c,dy {e,g} 份 (h.i } (e,f) a.bc.dy {e,f8} h,i 仍 (b,c) a.bc.dy {e,f8} (h.i }
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有