I do not understand the difference between the All Pairs Shortest Path problem (solved by the FloydWarshall algorithm) and the Shortest Path problem (solved by Dijkstra's algorithm).
All Pairs Shortest Path vs Shortest Path
algorithms;shortest path