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 votes163 views1 answer
Python type of column
Python
13 votes270 views3 answers
Python upload video to youtube
Python
4 votes181 views2 answers
Python get current user windows
Python
1 vote174 views1 answer
Accessing dictionary elements in python
Python
1 vote200 views1 answer
How to check whole number in python
Python
0 vote184 views1 answer
A function to create a null matrix in python
Python
0 vote173 views1 answer
Python replace list of ips from yaml file with new list
Python
117 votes177 views6 answers
Python how to get user input
Python
0 vote170 views1 answer
Parse list from string
Python
0 vote138 views1 answer
How to create a python virtual environment in linux
Python