The naive approach to all-pairs shortest paths is to run Dijkstra from every vertex. If you run Dijkstra times, the total time is . For dense graphs where , this becomes .
Floyd-Warshall gives you with no logarithmic factor and much simpler code. It also works with negative edges. The code is about lines compared to Dijkstra's priority queue machinery.
Space complexity is for the data structures used.