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

21 votes197 views3 answers
Python string to list of int
Python
0 vote197 views1 answer
Python yeild
Python
0 vote204 views1 answer
How to check if string is in byte formate pythin
Python
0 vote200 views1 answer
A = [ int(i) for i in range(100, 104)] list python
Python
0 vote198 views1 answer
Square finder python
Python
1 vote202 views1 answer
Flask socketio usage
Python
-1 vote206 views2 answers
Insert into string python more than one
Python
0 vote192 views1 answer
Add icon to exe file
Python
3 votes197 views2 answers
Creating new virtual environment in python
Python
1 vote238 views1 answer
Python valeur de pi
Python