Floyd-Warshall can solve related problems by changing the update rule. Minimax path: replace with and addition with to find paths where the maximum edge is minimized. Maximin path: replace with and addition with to find paths where the minimum edge is maximized.
The same structure solves different improvement problems. This shows the power of the dynamic programming formulation.
Space complexity is for the data structures used.