FLOYD-WARSHALL (Grafo G)
	for i = 1 to V do
		for j = 1 to V do
			D[i,j] = G[i,j]
			P[i,j] = 0
	for i = 1 to V do
		D[i,i] = 0
	for k = 1 to V do
		for i = 1 to V do
			for j = 1 to V do
				if D[i,j] > D[i,k]+D[k,j] do
					D[i,j] = D[i,k]+D[k,j]
					P[i,j] = k