1 votes 1 votes Time complexity for Maximum number of edges to be added to a tree so that it stays a Bipartite graph is?? answe given as O(v) using dfs but a option O(v+e) is also there why this cant be answer? eyeamgj asked Dec 10, 2018 eyeamgj 314 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Jaideep Bankoti commented Dec 10, 2018 reply Follow Share check this out this will help! https://www.geeksforgeeks.org/maximum-number-edges-added-tree-stays-bipartite-graph/ 0 votes 0 votes eyeamgj commented Dec 10, 2018 reply Follow Share i checked it dont have any doubt with procedure ..i m asking that why we can selectO(v+e) however it will be (v) becz e=n-1 tree but any one O(v+e) or O(v) should be there ?? 0 votes 0 votes Please log in or register to add a comment.
