Topological sort

def topological_sort():
    for each node:
        if visited[node] is False:
            dfs(node)
def dfs(node):
    visited[node] = True
    for nei in neighbours[node]:
        dfs(node)
    ret.insert_at_the _front(node)

-1

Source: sauravgpt.medium.com

Similar codes

1 vote310 views1 answer
Python class variables make blobal
Python
0 vote340 views1 answer
Python random phone number
Python
0 vote299 views1 answer
|safe django
Python
0 vote292 views1 answer
Get size of square matrix python
Python
128 votes384 views6 answers
Installing pip
Python
27 votes325 views3 answers
How to convert exe file to python file
Python
0 vote348 views1 answer
Visitor IP address django
Python Django
1 vote376 views1 answer
Sort a dict by values
Python
0 vote322 views1 answer
Plague meaning
Python
1 vote350 views1 answer
Wtf forms required
Python