title: How to find smallest cost of edges to add to a weighted graph to make it biconnected?
body: <p>This is related to the following problem- <a href="http://www.iarcs.org.in/inoi/contests/aug2005/Advanced-2.php" rel="nofollow">http://www.iarcs.org.in/inoi/contests/aug2005/Advanced-2.php</a> . Any hints on how to solve this problem?</p>