- ID : UVA - 10307 - Killing Aliens in Borg Maze
- Status : Accepted
- Type : Graph MST & BFS.
- Time : 5 Hours to Submission.
- Language : Java
- Solution :
- Assume 'S' is a normal node as 'A'
- BFS on all Nodes and Find all Edges.
- Kruskal MST on Edges using Union-Find Algorithm
- Problems :
- hashCode() Function shouldn't be implemented without equals()
- Hashing should be avoided with pre-indexing.
This Blog is a Personal record for All The Algorithms Problems I've Solved. It shouldn't be taken as a reference for optimal solutions because I'm just a beginner.
Monday, February 28, 2011
UVA - 10307 - Killing Aliens in Borg Maze
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment