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

3 votes212 views1 answer
How to get size of folder python
Python
2 votes149 views2 answers
Python code fpr fibon
Python
3 votes132 views1 answer
Python insert image
Python
21 votes141 views4 answers
Pyautogui install
Python
2 votes145 views1 answer
Clone website in python
Python
0 vote198 views1 answer
How to get one record in django
Python Django
10 votes158 views2 answers
Max columns in python
Python
1 vote188 views1 answer
Django return only part of string
Python Django
0 vote140 views1 answer
How to round off values in columns in pandas in excel
Python
1 vote156 views2 answers
Get user ip address django
Python