Given a graph $G=(V,E)$ with the adjacent matrix $W=w_{ij}$ with $W$ an $n\times n$ matrix. The following algorithm can compute the All-Pairs Shortest Path of $G$.

FLOYD-WARSHALL'(W) 1 D = W 2 for k = 1,2,...,n 3 for i = 1,2,...,n 4 for j = 1,2,...,n 5 $d_{ij} = \min(d_{ij}, d_{ik}+d_{kj})$

What is the SPACE complexity of this algorithm?