0 votes 0 votes https://gateoverflow.in/549/gate1992-01-ix WHAT IS CORRECT ANSWEER? eyeamgj asked Nov 12, 2018 eyeamgj 352 views answer comment Share Follow See 1 comment See all 1 1 comment reply Somoshree Datta 5 commented Nov 12, 2018 reply Follow Share If the edges are already sorted, then Kruskal's algorith should take O(ElogV) time. While picking up the edges one by one and adding them to the MST, we need to check whether any cycle is being formed or not by adding the particular edge in the MST which takes O(logV) time using union by rank algorithm(disjoint set data structure) .. 0 votes 0 votes Please log in or register to add a comment.