Finds shortest route from all points on a public transport network to arrive at a given destination at a given time. Uses Dijkstra's algorithm to do this all in one go