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

3 votes103 views1 answer
Python list of random float numbers
Python
3 votes101 views9 answers
Creating environment variable in python
Python
0 vote111 views1 answer
Python calander from Programmer of empires but updated
Python
1 vote154 views1 answer
Max pooling tf keras
Python
0 vote105 views3 answers
Pandas check if column type is list
Python
1 vote108 views1 answer
Update label text after pressing a button in Tkinter
Python
0 vote105 views2 answers
How to set breakpoint in python pdb
Python
1 vote107 views1 answer
Changing instance through dict changes all instances
Python
0 vote101 views1 answer
Import "sendgrid" could not be resolved django
Python
13 votes138 views4 answers
How to use if else in lambda python
Python