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

30 votes484 views6 answers
How to create a superuser in django
Python Django
-1 vote331 views1 answer
Unocode error pytonn
Python
5 votes363 views2 answers
Python get min max value from a dictionary
Python
0 vote357 views1 answer
Django.db.utils.ProgrammingError: can't adapt type 'dict_keys'
Python
0 vote339 views1 answer
Add dir to path python
Python
0 vote340 views1 answer
Get information about dataframe
Python
0 vote345 views1 answer
Joint Plot Seaborn
Python
1 vote359 views2 answers
How to print out text in python
Python
1 vote352 views1 answer
How to download excel file from s3 using python
Python
0 vote357 views3 answers
How to print a text in python
Python