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 vote236 views1 answer
K means image classification
Python
0 vote266 views1 answer
Python[17586:513448] ApplePersistenceIgnoreState: Existing state will not be touched. New state will be written to
Python
0 vote232 views1 answer
Drop portion of string in dataframe python
Python
0 vote246 views1 answer
Python find matching string regardless of case
Python
5 votes321 views3 answers
ImportError: No module named flask
Python Flask
0 vote251 views1 answer
How to get the current line number in python
Python
3 votes247 views2 answers
How to make a for loop increment by 2 in python
Python
32 votes269 views2 answers
Drop if nan in column pandas
Python
0 vote246 views1 answer
Printing hollow triangle in python
Python
0 vote239 views1 answer
How to make a number guessing game in python
Python