- ID : UVA - 10147 - Highways
- Language : Java , C++
- Status : TLE - Accepted
- Type : Graph MST.
- Time : 10 Hours.
- Solution :
- Find All Edges
- Kruskal's MST.
- Problems :
- JAVA TLE Sometimes has no solution so don't waste your time in trying to get a Java solution Accepted.
- Make sure the second minimum MST is larger than the Original MST.
- Solutions :
Wednesday, March 2, 2011
UVA - 10147 - Highways
Subscribe to:
Posts (Atom)