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 vote178 views1 answer
Python turtle triangle
Python
0 vote176 views1 answer
Aggregation with f() in django rest api
Python
1 vote162 views2 answers
Build dataframe from dictionary
Python
0 vote166 views1 answer
Can is slice list with list of indices python
Python
1 vote164 views1 answer
$ sudo pip install pdml2flow-frame-inter-arrival-time
Python
1 vote154 views1 answer
Delimiter pandas
Python
3 votes227 views2 answers
Playsound moudle python
Python
0 vote174 views1 answer
Python try script
Python
0 vote175 views1 answer
Python interface kenee
Python
0 vote164 views1 answer
Generate unique id from given string python
Python