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 vote155 views1 answer
How to read frame width of video in cv2
Python
8 votes156 views2 answers
How to check if a word is in a dictionary
Python
0 vote182 views1 answer
Apa itu duck typing python
Python
8 votes156 views2 answers
Python using webbrowser
Python
5 votes357 views2 answers
Django connexion session time
Python Django
18 votes157 views4 answers
Python get all combinations of list
Python
1 vote169 views1 answer
How to get sum specific columns value in machine learning
Python
0 vote168 views1 answer
Inherit functions from other classes
Python
0 vote146 views1 answer
Disable console messages in Flask server
Python
21 votes229 views5 answers
Base64 python decode
Python