← Questions
Topological sort of a directed graph
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return an order of a directed graph's nodes in which every edge goes from earlier to later, or report a cycle. Give Kahn's algorithm and the DFS version. Only the title of this report was public.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding