# MST Kruskal

1 vote
209 views

First statement is False because complexity will be O(E2).

I think the second statement is true? But not sure

2

I think both are false.

For 1st, It will be O(EV) because the decrease-key operation will take O(n) times and we have to perform that operation E times.

For 2nd, Kruskal's algorithm is always disconnected. Here always word makes it false, we can intentionally create such a graph where kruskal's MST is also connected.

For example: 1 ---> 2  ---> 3 ---> 4
(1)        (2)       (3)

0

First Statement:

Sorted linked list wil be the list of edges. so to decrease key operation will take O(E).

Time Complexity of Dijkstra = O(V Textract-min + E Tdecrease-key) = O(V + E2). Extract-min takes O(1)

0
for,

1- it will be O(V + EV) = O(EV), hence false

2- false, due to word 'always disconnected' in case of Kruskal
0

Second statement is true Because

For Prim at each step we have connected tree.

For Kruskal at each step we have disconnected tree. Code from Cormen

We make separate sets for each vertex and add edges one by one to connect different trees. (always we have a forest).

2

@Shivam,

apply kruskal in this graph you will get only single connected tree at every connected

0
Thanks @joshi_nitish I got the answer.

## Related questions

1
130 views
Time Complexity of Kruskal - O(mlogm + n.O(1) + m.logn) mlogm --> for sorting edges in increasing order. n.O(1) --> n UNIONS as we've n nodes in G and each takes O(1) m.logm --> Find operation takes logn time as height of tree can never me more than logn and we have m such find operations as we have m edges in G. Now my doubt is - is it O(mlogm) or O(mlogn)? I know, given is O(mlogn), but how?
1 vote
Complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are unsorted is _______ ______________________________________________________________________________ If elements are sorted we do with Union Find algo with inverse of ... $log^{*}V$ Now from here can we derive it for unsorted edges? for ref: here