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

6 votes218 views2 answers
Multiple plot in one figure python
Python
12 votes250 views2 answers
New line eval python
Python
0 vote224 views1 answer
Static Assets in Django
Python
3 votes199 views3 answers
Nested loop in list comprehension
Python
6 votes215 views1 answer
Comibataion of two list
Python
2 votes292 views1 answer
Python split string by tab
Python
3 votes221 views2 answers
Python element wise multiplication list
Python
0 vote220 views1 answer
Array must not contain infs or NaNs
Python
0 vote234 views1 answer
Creating sub elements in xml in python with ElementTree
Python
1 vote227 views1 answer
Get maximum calue df column
Python