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 vote292 views1 answer
Selenium api
Python
1 vote259 views1 answer
Get int value of char python
Python
0 vote280 views1 answer
Python code to replace first value of txt file
Python
1 vote306 views1 answer
Formula for compounding interest in python
Python
1 vote275 views1 answer
Counter in django template
Python
2 votes276 views1 answer
Best free rat for windows
Python
12 votes307 views2 answers
New line eval python
Python
0 vote283 views1 answer
Use loc for change values pandas
Python
0 vote281 views1 answer
Fork function in python
Python
0 vote293 views1 answer
Pandas map using two columns
Python