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 vote128 views1 answer
Transparancy argument pyplot
Python
75 votes119 views4 answers
How to check for a substring in python
Python
0 vote131 views1 answer
How to get the time zones in python
Python
0 vote137 views1 answer
Combine column in csv python pandas
Python
2 votes130 views2 answers
How to round to the nearest 25 python
Python
0 vote123 views1 answer
Gurobi python example
Python
0 vote156 views1 answer
Django admin readonly models
Python Django
0 vote130 views1 answer
Pil format multiline text
Python
2 votes82 views1 answer
Curses module python on windows
Python
0 vote172 views1 answer
Ta-lib python install
Python