First iteration of Dijkstra shortest path algorithms implemented
Basic route functionality now implemented; first selecting a system then shift-clicking on another will draw the shortest (currently based purely on distance) route between the two