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

2 votes254 views3 answers
Play mp3 file python
Python
0 vote187 views2 answers
Composition in python
Python
0 vote184 views1 answer
How to use methods defined within class
Python
1 vote219 views1 answer
Error: Command '['/home/robert/python/python_p/env/bin/python3.8', '-Im', 'ensurepip', '--upgrade', '--default-pip']' returned non-zero exit status 1.
Python
21 votes194 views3 answers
Show all rows python
Python
0 vote197 views3 answers
Python convert dat file to csv
Python
2 votes216 views2 answers
Check negative number in python
Python
2 votes239 views1 answer
Import validation error in django
Python Django
0 vote207 views2 answers
Get random vowel python
Python
0 vote181 views1 answer
No matching distribution found for numpy.core._multiarray_umath
Python