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 vote179 views1 answer
Print treelib.Tree
Python
15 votes161 views6 answers
Python list max value
Python
0 vote161 views1 answer
Block url selenium python
Python
23 votes154 views4 answers
Rename row pandas
Python
1 vote162 views1 answer
Remove idx of list python
Python
0 vote156 views1 answer
Django queryset group by sum
Python
1 vote155 views1 answer
Python edit item in list
Python
11 votes174 views6 answers
BeautifulSoup
Python
19 votes124 views2 answers
Install selenium python
Python
0 vote170 views2 answers
How to JOIN three tables with Django ORM
Python