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 (47.14 KiB) Viewed 49 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() 3 for each edge (u, v) E G.E if FIND-SET(u) + FIND-SET(V) UNION(, v) 4 If G were the following graph, how many iterations of the loop numbered 1-2 in the pseudocode above are executed? Select one: O a. 4 O b. 0 O c. 10 O d. 7 O e 1