i actually found myself implementing Dijkstra's shortest path algorithm in some code yesterday. imagine that. actually using something learned in a data structures and algorithms class for real-life, useful code.
if i get really ambitious, maybe i'll throw in some Floyd-Warshall or Johnson all-pairs shortest path stuff. (though for now, iterated Dijkstra appears to be more than fast enough and isn't even remotely the bottleneck in the code)