Bit of code I wrote to demonstrate knowledge of data structures & algorithms. The input is a graph (in this case the graph is a map of the attractions at Disney Land) and the output is a minimum spanning tree of the shortest distance to every attraction.