3 votes 3 votes Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$ Algorithms algorithms prims-algorithm time-complexity + – pC asked Sep 22, 2017 • retagged Jul 10, 2019 by Cristine pC 2.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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)$ atul_21 answered Sep 22, 2017 • edited Jul 11, 2019 by akash.dinkar12 atul_21 comment Share Follow See all 2 Comments See all 2 2 Comments reply Arjun commented Sep 22, 2017 reply Follow Share if connected :) 4 votes 4 votes atul_21 commented Sep 23, 2017 reply Follow Share Oh yes 0 votes 0 votes Please log in or register to add a comment.