Optimized Hamiltonian tour over a complete graph - FALL 2011 (Team size - 4)
- Constructed of minimal spanning tree
- Performed a Depth First Traversal and identified an optimal tour using nearest neighbor and 2-opt heuristics.
- Data Structures implemented : heaps, stacks, hash tables and sets.