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

25 votes142 views5 answers
Pandas show all dataframe
Python
0 vote141 views1 answer
Soup.find_all attr
Python
7 votes147 views4 answers
Random word generator python
Python
5 votes168 views3 answers
How to add images in hml while using flask
Python Flask
1 vote139 views1 answer
How to check any script is running in background linux using python
Python
0 vote144 views1 answer
From matrix to array python
Python
2 votes145 views3 answers
Django queryset to list
Python
0 vote91 views1 answer
Create bbox R sp
Python
116 votes136 views3 answers
How to check if some file exists in python
Python
0 vote165 views1 answer
Django admin readonly models
Python