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 vote156 views1 answer
How to get data in treeview in tkiter
Python
-1 vote157 views1 answer
Decimal conversion python
Python
34 votes181 views6 answers
Round python
Python
1 vote157 views1 answer
Split string form url last slash
Python
0 vote166 views1 answer
List Change a Element
Python
12 votes170 views1 answer
Rand
Python
0 vote198 views2 answers
Django get superuser password
Python Django
0 vote207 views1 answer
Django filter values with e and operator
Python Django
0 vote165 views1 answer
How to take out every even number from a list in python
Python
2 votes155 views6 answers
Python virtual env
Python