calculating time complexity of kruskal algorithm by this way is right?
build min heap- storing edges - O(n)
extracting edges V-1 times - O((v-1) log E) ~ O(V log E)
so total time complexity is O(E +V log E) or O(E+ E log E)
while extracting edges if first V-1 edges are not creating cycle then it is best case- O(E+ V log E)
and if need to extract all edges because only last edge is not creating cycle - O(E+ E log V)