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

0 vote338 views1 answer
Sort list in python by substring
Python
0 vote359 views1 answer
Python added dictionary together
Python
5 votes331 views4 answers
Append to a tuple
Python
0 vote344 views1 answer
Integers come in all sizes solution in python3
Python
0 vote331 views1 answer
Validating email addresses with a filter hackerrank
Python
0 vote330 views1 answer
What does it mean when i get a permission error in python
Python
0 vote350 views1 answer
Db connection string timeout
Python
67 votes346 views4 answers
List slicing reverse python
Python
1 vote329 views1 answer
Index a dictionary python
Python
0 vote391 views1 answer
Name 'csv' is not defined
Python