UVA - 10600 - ACM Contest and Blackout

• ID : UVA - 10600 - ACM Contest and Blackout
• Status : Accepted
• Type : Graph MST .
• Time : 2 Hours to Submission.
• Language : Java
• Solution :
1. Find MST
2. Find MST in every time you remove an edge from the Original MST
• Problems :
1. Make sure the MST is not the Original MST by removing the edges from the original MST and looping through all edges.
2. Make sure the second minimum MST is larger than the Original MST.