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

37 votes135 views6 answers
Lambda function in python
Python
0 vote149 views1 answer
How to preserve white space when joining an array python
Python
0 vote144 views4 answers
Python convert dict_keys to list
Python
3 votes135 views2 answers
Thread with args python
Python
0 vote135 views1 answer
Numpy histogram 0 to 100 percent
Python
0 vote132 views1 answer
Django auto increment field
Python
0 vote124 views1 answer
Balancing paranthesis python
Python
0 vote125 views1 answer
Algorithme permettant de passer au negatif une image
Python
0 vote125 views1 answer
Gitpod how to execute python file
Python
3 votes120 views3 answers
Python selenium clear input
Python