Generic Dijkstra's Algorithm

Through various projects, I've had to do some shortest-path finding in a connected graph. An efficient and straight-forward way to do this is using Dijkstra's Algorithm. While I've used the algorithm on several occasions, it's only now that I've rewritten it in generic form.