/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 vote184 views1 answer
Python get nearest value in list
Python
6 votes190 views4 answers
Uninstall python 2.7 in ubuntu
Python
2 votes218 views1 answer
Expected ")" python
Python
0 vote176 views1 answer
Numpy generlized ufunc
Python
0 vote174 views1 answer
Django 2.2 disable cache settings.STATIC_URL
Python
2 votes182 views1 answer
Python sort the values in a dictionaryi
Python
0 vote200 views2 answers
Python datetime now minus 3 hours
Python
2 votes298 views2 answers
Csv manipulation python
Python
22 votes180 views6 answers
Tkinter button
Python
0 vote179 views1 answer
Compile python folder
Python