Register

Search results for prims-algorithm

2 votes
2 answers
4
Gate@Zeal Booklet
Can anyone help in solving the question 105 to 109. I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
Can anyone help in solving the question 105 to 109.I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
User Avatar
5 votes
3 answers
6
Difference between Kruskal's and Prim's algorithm ?
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 ?
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 ?
User Avatar
0 votes
2 answers
7
UGC NET CSE | October 2020 | Part 2 | Question: 78
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node $a$ ... $(a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)$
Consider the undirected graph below:Using Prim’s algorithm to construct a minimum spanning tree starting with node $a$, which one of the following sequences of edges re...
User Avatar
0 votes
1 answer
8
Prim Algorithm
What is the time complexity of Prim algorithm without using min heap?
What is the time complexity of Prim algorithm without using min heap?
User Avatar
1 votes
0 answers
10
Cormen 23.2-3
For a sparse graph $G=(V,E)$ where $|E|=\Theta (V)$ ... Plz tell me difference between Sparse and Dense graph here? How Dense graph implemented and how it make difference for this question
For a sparse graph $G=(V,E)$ where $|E|=\Theta (V)$ is the implementation of Prim’s algorithm with a Fibonacci heap asymptotically faster than the binary-heap implement...
User Avatar
2 votes
2 answers
13
Gradeup Test series
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm?$O (E \hspace{0.1cm}log\hspace...
User Avatar
3 votes
1 answer
15
Analysis Of Prims Algorithm Time Complexity
Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
User Avatar
1 votes
2 answers
17
Regarding prims algo
Hello, I have doubt regarding prims algorithm 1)should we choose the lowest cost edge and then implement algo further? 2)Or we choose any vertex and then lowest cost edge of that vertex?
Hello,I have doubt regarding prims algorithm1)should we choose the lowest cost edge and then implement algo further?2)Or we choose any vertex and then lowest cost edge of...
User Avatar
2 votes
2 answers
18
Which of the following is the possible sequence of edges when Prim's algorithm is applied ?
(a,b),(b,c),(a,d),(e,f),(d,g),(c,e) (g,f),(f,c),(g,d),(c,e),(d,b),(d,a) (c,f),(c,e),(e,d),(a,b),(d,g),(b,c) None of the above
(a,b),(b,c),(a,d),(e,f),(d,g),(c,e)(g,f),(f,c),(g,d),(c,e),(d,b),(d,a)(c,f),(c,e),(e,d),(a,b),(d,g),(b,c)None of the above
User Avatar
1 votes
0 answers
19
Prim's algorithm for MST
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm. Justify this statement.
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
User Avatar
1 votes
0 answers
20
MST Kruskal
First statement is False because complexity will be O(E2). I think the second statement is true? But not sure
First statement is False because complexity will be O(E2).I think the second statement is true? But not sure
User Avatar
Page: