search
Log In

Recent questions tagged kruskals-algorithm

2 votes
3 answers
1
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)
asked Jun 9, 2019 in Algorithms Hirak 496 views
0 votes
1 answer
2
0 votes
2 answers
3
1 vote
1 answer
4
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
asked Jun 30, 2018 in Algorithms srestha 682 views
5 votes
1 answer
5
Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___? My answer was 1 and given is 2 ,what I am missing ? Edit:I had confirmed with it and answer is only one tree possible.
asked Jan 2, 2018 in Algorithms sunil sarode 853 views
3 votes
2 answers
6
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
asked Jan 24, 2017 in Algorithms Kapil 2.2k views
0 votes
1 answer
7
Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithm i am getting "4" but the answer is given "5" ...verify please
asked Jan 19, 2017 in Algorithms Prateek kumar 546 views
2 votes
1 answer
8
I have seen many varients of complexities using diferent data structures in implementing Kruskal Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
asked Dec 18, 2016 in Algorithms PEKKA 3.3k views
2 votes
3 answers
9
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
asked Oct 26, 2016 in Algorithms Geet 1k views
2 votes
1 answer
10
To see more, click for the full list of questions or popular tags.
...