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 vote185 views1 answer
Python how to initialize wikipediaapi
Python
6 votes300 views1 answer
Jupyter pdataframe max rows
Python
0 vote196 views1 answer
How to convert tuple to int in python
Python
0 vote242 views1 answer
Np shuffle
Python
14 votes190 views3 answers
Flatten lists python
Python
0 vote189 views1 answer
Discard method in python
Python
30 votes238 views4 answers
Python get current hour
Python
0 vote252 views2 answers
Python dict for k v
Python
1 vote256 views1 answer
No such table: django_session admin
Python Django
0 vote193 views1 answer
Python program to check whether a specified value is contained in a group of values
Python