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

1 vote100 views2 answers
Split a string with 2 char each in python
Python
13 votes103 views3 answers
Pygame mouse pos
Python
1 vote111 views1 answer
Get time between things python
Python
25 votes131 views2 answers
Create new django app
Python
3 votes59 views1 answer
Get_absolute_url in django template
Python
0 vote108 views1 answer
Seaborn orient
Python
0 vote130 views1 answer
The Bytearray Type
Python
0 vote92 views1 answer
How to use selenium on default chrome python
Python
11 votes106 views3 answers
Delete row from dataframe python
Python
0 vote100 views1 answer
Split df coliumn
Python