Based in Honolulu, HI, 3leet5u is the software sketchbook of Tristan Madden.

UVa 1112 - Mice and Maze

This problem deals with a pretty small graph, so I chose to implement the Floyd-Warshall Algorithm instead of Dijkstra's Algorithm for the sake of simplicity. This algorithm finds the shortest path between every pair of vertices in a graph so it runs in O(n^3) time. Which sounds bad, but the UVA judge accepted this program with a run time of 0.12s which is well withing the 3-second threshold. I wrote this algorithm in an object-oriented, array-averse way so that if I ever have enough free time I can drop this into to Processing and visualize it in 3D.

Comparing Java distance functions

Minimum Spanning Tree Visualized