1 votes 1 votes Is time complexity of union find algo on an undirected graph G with V vertices and E edges O(E) ? Algorithms graph-algorithms union-find + – A_i_$_h asked Oct 22, 2017 • retagged Jun 11, 2022 by Arjun A_i_$_h 207 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes YES for find and union, but if u're asking of finding the connected components in the graph (like we do in kruskal's algo) then the whole time complexity comes down to O(ElogV). refer CLR page 631 skyby answered Oct 22, 2017 skyby comment Share Follow See all 0 reply Please log in or register to add a comment.
