You are running the Kruskal's algorithm to obtain the minimum spanning tree of a connected, undirected, weighted graph with 10 vertices (ID-0 to ID-9). Given the following parent array state of the union-find data structure during the algorithm's run, which of the following statement(s) is true?

Question

Accepted Answer

There are currently 6 trees in the forest.

Accepted Answer

Calling find(2) returns 7.

Accepted Answer

Performing union(0,3) will cause the following changes to the parent array:

Accepted Answer

A tree with vertex-2 as a node has a size of 2.

Answer

Performing union(8,5) will cause the following changes to the parent array:

Answer

A tree with vertex-2 as a node has a size of 7.

Answer

Given a graph-G with vertex-u and vertex-v, we can safely assume that the minimum spanning tree of graph-G will contain edge (u,v) if parent[u]=v or parent[v]=u.

Answer

Calling find(5) returns -1.

Crowdly

You are running the Kruskal's algorithm to obtain the minimum spanning tree of a...

Хочете миттєвий доступ до всіх перевірених відповідей на learning.monash.edu?