Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

Tree to BCC

Revision en1, by john_hopes, 2015-12-18 09:44:57

How can I find the minimum number of edges need to be added to convert a tree graph to binconnected component such that if we remove an edge from that graph, the graph remain connected? Please give me some idea to do that! Thanks in advance :)

Tags graphs, bcc, dfs


  Rev. Lang. By When Δ Comment
en1 English john_hopes 2015-12-18 09:44:57 254 Initial revision (published)