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 vote110 views2 answers
Font in tkinter
Python
-2 votes92 views1 answer
Tkinter bind function with arguments
Python
16 votes104 views5 answers
Add two dataframes together
Python
3 votes65 views2 answers
Python replace values in a matrix
Python
0 vote93 views2 answers
Error: Could not locate a Flask application. You did not provide the "FLASK_APP" environment variable, and a "wsgi.py" or "app.py" module was not found in the current directory.
Python
2 votes99 views3 answers
Python poetry
Python
0 vote111 views1 answer
If function has no argument python
Python
2 votes100 views2 answers
Moving average numpy
Python
2 votes97 views2 answers
What is a print statement
Python
0 vote104 views1 answer
Set colour to inserplaintext qtextedit in python
Python