Use Dijkstra's algorithm to find all the shortest paths. And now
consider the floor as a weighted graph instead of unweighted.