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 vote193 views1 answer
Distplot for 2 columns
Python
6 votes201 views2 answers
Tkinter template
Python
0 vote179 views1 answer
Tkinter hide legend
Python
147 votes310 views5 answers
Python check if folder exists
Python
5 votes199 views1 answer
Check django object exists
Python
16 votes257 views4 answers
Dataframe find nan rows
Python
0 vote200 views1 answer
Python tkinter AttributeError: 'NoneType' object has no attribute 'insert'
Python
0 vote206 views1 answer
Seaborn orient
Python
6 votes208 views1 answer
Django desc order
Python
0 vote191 views1 answer
ApiError('d984ac0ae28d4afda0ddb26e348db535', UploadError('path', UploadWriteFailed(reason=WriteError('malformed_path', None), upload_session_id='AAAAAAAAACLukDh6ck8ZUw'))) python
Python