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 vote123 views2 answers
Remove columns that contain string pandas
Python
4 votes177 views1 answer
Print type of exception python
Python
45 votes152 views1 answer
How to turn python vs code into a executable
Python
12 votes142 views2 answers
Write number of lines in file python
Python
3 votes150 views1 answer
Esp32 micropython timer
Python
7 votes144 views3 answers
Python calendar
Python
1 vote143 views1 answer
How to use arjun tool
Python
31 votes141 views1 answer
UnicodeDecodeError: 'charmap' codec can't decode byte 0x9d in position 6148: character maps to <undefined>
Python
7 votes156 views4 answers
From django.contrib import messages
Python
3 votes142 views1 answer
Python count number of unique elements in a list
Python