/Python/Python warshall algorithm stackoverflow

Python warshall algorithm stackoverflow

def warshall(a):
    assert (len(row) == len(a) for row in a)
    n = len(a)
    for k in range(n):
        for i in range(n):
            for j in range(n):
                a[i][j] = a[i][j] or (a[i][k] and a[k][j])
    return a

Source: stackoverflow.com

Similar codes

0 vote171 views1 answer
How to cycle a list in python
Python
0 vote182 views1 answer
Reportlab page size a4
Python
0 vote168 views1 answer
How to query json field django
Python
16 votes168 views6 answers
Python raise exception
Python
0 vote424 views1 answer
Np array blurring
Python
0 vote175 views1 answer
Unhexing floats
Python
0 vote178 views2 answers
How do I stop Selenium from closing my browser
Python
1 vote181 views1 answer
Python dividing strings by amount of letters
Python
17 votes179 views1 answer
Np.save function
Python
2 votes194 views1 answer
Python how to get the last element in a list
Python