f6466c503e6fac43c18a884e553819278430955d,grakel/graph.py,,floyd_warshall,#Any#,1699

Before Change

    // Calculation
    for k in range(0, n):
        for i in range(0, n):
            for j in range(0, n):
                if (dist[i, j] > dist[i, k] + dist[k, j]):
                    dist[i, j] = dist[i, k] + dist[k, j]

    return dist

After Change

    // Calculation
    for k in range(adjacency_matrix.shape[0]):
        for i in range(adjacency_matrix.shape[0]):
            dist[i, :] = np.minimum(dist[i, :], dist[i, k] + dist[k, :])

    return dist

Instances