Register

Recent questions tagged prims-algorithm

1 1 vote
1 answers 1 answer
1.3k
1.3k views
Question - 2 | DPP | Greedy Method
Which of the statement is/are correct?(a) First edge added by Kruskal’s algorithm can be the last edge added by prim’s algorithm(b) In a graph, if one raises the length o...
User Avatar
1 1 vote
1 answers 1 answer
1.0k
1.0k views
Made Easy Test Series 2024
pls give all possible sequences possible for prims algo Consider the undirected graph below:Using Prim's algorithm to construct a minimum spanning tree starting with node...
User Avatar
3 3 votes
2 answers 2 answers
2.6k
2.6k views
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.
User Avatar
0 0 votes
0 0 answers
486
486 views
UGCNET CSE December 2022: 72
Match $\text{List I}$ with $\text{List II}$$\text{List I}$$\text{List II}$$\text{A}$. Dijkstra's Algorithm$\text{I}$. Calculates path matrix$\text{B}$. Prim's Algorithm$\...
User Avatar
1 1 vote
2 2 answers
3.0k
3.0k views
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$, which one of the following sequences of edges repr...
User Avatar
0 0 votes
1 1 answer
1.8k
1.8k views
Prim Algorithm
What is the time complexity of Prim algorithm without using min heap?
User Avatar
1 1 vote
0 0 answers
1.7k
1.7k views
Cormen 23.2-3
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 implementat...
User Avatar
1 1 vote
0 0 answers
3.1k
3.1k views
CLRS INTRODUCTION TO ALGORITHMS 3rd Edition, CHAPTER 23 QUESTION 23.2.7
suppose that a graph G has MST already computed. How quickly can we update the MST if we add a new vertex and incident edges to it.I know for the best case scenario when ...
User Avatar
2 2 votes
1 answers 1 answer
2.5k
2.5k views
cormen 2nd edition excercise 23-2-5
Suppose that all edge weights in a graph are integers in the range from 1 to |V|. How fast can you make Prim's algorithm run? What if the edge weights are integers in the...
User Avatar
2 2 votes
2 answers 2 answers
2.8k
2.8k views
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.1...
User Avatar
2 2 votes
0 0 answers
1.5k
1.5k views
TEST SERIES
Consider the following graph and Assume node ‘P’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges to which they are a...
User Avatar
5 5 votes
1 1 answer
2.6k
2.6k views
How many MST is possible?
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 mi...
User Avatar
1 1 vote
2 answers 2 answers
907
907 views
Regarding prims algo
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 2 votes
2 2 answers
930
930 views
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
User Avatar
1 1 vote
0 0 answers
1.5k
1.5k views
MST Kruskal
First statement is False because complexity will be O(E2).I think the second statement is true? But not sure
User Avatar
1 1 vote
0 0 answers
1.4k
1.4k views
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.
User Avatar
3 3 votes
1 1 answer
3.0k
3.0k views
Analysis Of Prims Algorithm Time Complexity
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
User Avatar
0 0 votes
0 0 answers
702
702 views
Self Doubt (Graphs)
How to understand this: For a connected graph, V = O(E))SOURCE http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/prims algo...
User Avatar
1 1 vote
0 0 answers
1.5k
1.5k views
prims algo from cormen
Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it)Algorithms uses min queue in process, my dobut is when ...
User Avatar
1 1 vote
1 answers 1 answer
545
545 views
Test by Bikram | Algorithms | Test 2 | Question: 11
Let the node P be the starting vertex for Prim's Algorithm as given in the diagram below:In order to construct the Minimum Spanning Tree, which of the following options r...
User Avatar
5 5 votes
3 3 answers
5.0k
5.0k views
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 ?
User Avatar
0 0 votes
0 0 answers
3.0k
3.0k views
Prim's Algorithm
I am getting B and C both. Answer is given as C. Where am I wrong?
User Avatar
0 0 votes
3 3 answers
2.4k
2.4k views
Virtual Gate Test Series: Algorithms - Minimum Spanning Tree
I think all options are wrong
User Avatar
0 0 votes
0 0 answers
757
757 views
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
User Avatar
2 2 votes
0 0 answers
1.2k
1.2k views
Analysis Of Prims Algorithm
I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how ...
User Avatar
2 2 votes
3 3 answers
2.5k
2.5k views
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
User Avatar
0 0 votes
1 1 answer
1.1k
1.1k views
some1 plz explain why the time complexity of Prims algorithm using arrays is O(v^2+2E)...thanks in advance
User Avatar
0 0 votes
1 1 answer
969
969 views
Algorithms
Can anyone explain me the time complexity of Prim's algorithm?
User Avatar
Page: