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 vote314 views2 answers
How to make a gui with kivy
Python
2 votes284 views1 answer
Python custom errors
Python
1 vote296 views1 answer
Python make file path os
Python
0 vote309 views1 answer
Tensor.numpy() pytorch gpu
Python
0 vote294 views1 answer
Python list.append string return empty
Python
6 votes323 views1 answer
Np euclidean distance python
Python
0 vote344 views10 answers
EMAIL_BACKEND = 'django.core.mail.backends.console.EmailBackend'
Python Django
1 vote295 views1 answer
View whole dataset in python
Python
7 votes329 views3 answers
How to exit venv in python
Python
1 vote317 views1 answer
How to check for duplicates in a column in python
Python