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 vote226 views2 answers
Decimal to ascii python
Python
6 votes212 views1 answer
Np euclidean distance python
Python
0 vote180 views6 answers
Convert from python code to c++ code
Python
1 vote162 views1 answer
Django admin auto generate slug
Python
1 vote225 views1 answer
Sha256 pandas
Python
0 vote211 views1 answer
Pyspark rdd method
Python
1 vote234 views1 answer
Jinja2 template import html with as
Python
0 vote194 views1 answer
Plt tickpad
Python
5 votes232 views4 answers
If queryset is empty django
Python Django
0 vote220 views1 answer
Unable to load celery application the module was not found
Python