One of the many applications of disjoint-set data structures arises in determining the connected components of an undire

[answerhappygod]

One Of The Many Applications Of Disjoint Set Data Structures Arises In Determining The Connected Components Of An Undire 1 (77.21 KiB) Viewed 37 times

One of the many applications of disjoint-set data structures arises in determining the connected components of an undirected graph. For a given graph G, the following algorithm was presented to determine its connected components: CONNECTED-COMPONENTS(G) 1 for each vertex v E G.V 2 MAKE-SET(v) 3 for each edge (u, v) E G.E 4 if FIND-SET(U) + FIND-SET(v) 5 UNIONU,V) If G were the following graph, how many iterations of the loop numbered 3-5 in the pseudocode above are executed? Select one: O a. 7 Ob. 1 O c. 4 O d. 0 O e. 10