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 vote156 views1 answer
Django queryset last 10
Python Django
4 votes132 views2 answers
Split filename and extension python
Python
0 vote122 views1 answer
Mechanize python XE #26
Python
1 vote120 views2 answers
How to add numbers in python using for loop
Python
-1 vote144 views1 answer
Pandas merge_asof direction
Python
0 vote170 views1 answer
Python currency format locale
Python
4 votes167 views3 answers
Round down decimal python
Python
0 vote122 views1 answer
Sum values in django models and insert value in model field
Python
2 votes137 views1 answer
Arctan calculator
Python
1 vote130 views1 answer
Read image python
Python