M
Explanation by: Mr. Dubey
kruskal’s algorithm involves sorting of the edges, which takes o(e loge) time, where e is a number of edges in graph and v is the number of vertices. after sorting, all edges are iterated and union-find algorithm is applied. union-find algorithm requires o(logv) time. so, overall kruskal’s algorithm requires o(e log v) time.
You must be Logged in to update hint/solution
Related MCQs
Q. In ROM, each bit combination that comes out of the output lines is called
Q. Which causes the microprocessor to immediately terminate its present activity:
Q. class Test { int x; }; int main() { Test t; cout << t.x; return 0; }
Q. Organisational decisions are made by ------
Q. The XOR gate will produce a HIGH output if only one but not both of the inputs is HIGH.
Q. A measure of goodness of fit for the estimated regression equation is the
Q. Which of the following is a function of CASE Tool?
Q. _________ matrix represents the distance between all objects in the dataset
Q. In the relational model, relationships between relations or tables are created by using:
Q. Dynamic addressing doesn’t allow many devices To share limited address space on a network
Discusssion
Login to discuss.