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

2 votes158 views1 answer
How to chang your facebook name
Python
2 votes154 views1 answer
Remove rows or columns with NaN value
Python
8 votes189 views3 answers
Import turtle as t
Python
1 vote207 views1 answer
Python get object class
Python
10 votes179 views6 answers
Xpath contains text
Python
0 vote162 views1 answer
ImportError: cannot import name 'Request' from 'urllib2' (unknown location)
Python
0 vote233 views1 answer
Python generalised eigenvalue problem
Python
0 vote217 views2 answers
Python merge strings
Python
13 votes177 views5 answers
Group by pandas count
Python
0 vote194 views1 answer
Python developer job description
Python