retagged by
2,508 views

1 Answer

0 votes
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

Related questions

0 votes
0 votes
1 answer
1
anonymous asked Jun 26, 2016
643 views
1 votes
1 votes
0 answers
4
just_bhavana asked Oct 30, 2017
820 views
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.