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

1 vote254 views3 answers
Python sort list by custom function
Python
0 vote268 views1 answer
Pandas correlation matrix between one column and all others
Python
6 votes242 views2 answers
Pad zeros to a string python
Python
1 vote256 views1 answer
Show chrome devtools in selenium
Python
4 votes274 views1 answer
What is cleaned data in django
Python
0 vote264 views1 answer
How to send more than one variables to python using xlwings
Python
0 vote281 views1 answer
Sklearn logistic regression get probability
Python
0 vote249 views1 answer
Pip neat
Python
10 votes256 views3 answers
Pacman 30th anniversary
Python
22 votes269 views4 answers
Access first element of dictionary python
Python