Register

Analysis Of Prims Algorithm Time Complexity

• retagged by
2,951 views

1 Answer

0 0 votes
The no. of edges in a sparse graph can be $(V-1)$ and in dense, it may go up to $O(V^2)$

therefore it wouldn't be incorrect to write$ O(ElogV +VlogV)= O(ElogV)$
• edited by
Voting & Accepting an answer helps improve the community
← Previous · Ex-OR gateNext → · Important Discussio...
← Previous in category · Bucket sortNext in category → · Time complexity
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.1k
1.1k views
anonymous asked Jun 26, 2016
1,105 views
some1 plz explain why the time complexity of Prims algorithm using arrays is O(v^2+2E)...thanks in advance
2 2 votes
0 0 answers
1.2k
1.2k views
PEKKA asked Dec 18, 2016
1,169 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 ...
1 1 vote
2 2 answers
3.0k
3.0k views
dhingrak asked Jan 5, 2015
3,042 views
Prim's Algorithm
Which one of following statement is false about prim's algorithm?a) It use a running time of O(Elog2V) using binary heapb) It may use a binomial max-heap to represent the...
1 1 vote
0 0 answers
1.4k
1.4k views
just_bhavana asked Oct 30, 2017
1,372 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.