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

0 vote211 views1 answer
Pytorch pad to square
Python
23 votes217 views5 answers
Pandas select rows by multiple conditions
Python
1 vote197 views2 answers
1d array to one hot
Python
2 votes195 views1 answer
Django.core.exceptions.ImproperlyConfigured: WSGI application 'souroSANOU.wsgi.application' could not be loaded; Error importing module.
Python
0 vote201 views1 answer
Split pandas dataframe in two
Python
-1 vote183 views1 answer
Recursive class method python
Python
2 votes196 views1 answer
Python list of all tkinter events
Python
11 votes205 views5 answers
Python ordereddict
Python
1 vote185 views1 answer
Add text to the middle of the window tkinter
Python
0 vote180 views1 answer
Cvtcoloer opencv
Python