Floyd algorithm, in function, time = 5 sec

import random
random.seed(179)

def f(A, N):
    for k in range(N):
        for i in range(N):
            for j in range(N):
                A[i][j] = min(A[i][j], A[i][k] + A[k][j])

N = 200
f([ [random.randint(1, 10000) for i in range(N)] for j in range(N)], N)