Graph Topological Sort Using Depth-First Search

How does the second example work if it contains a cycle(D,PX,C,D) ?

Can you make a video on how to do topological sort with Breadth first search? All the demo videos I have seen so far uses DFS.

It does not work for a lot of graphs :(

thanks so much, it was very helpful

According to Introduction to Algorithms (Thomas H. Cormen),
Topological sort :
compute finishing time and add nodes to linked list as it ends
return list
Thats it!!
O(V+E)

Really amazing. You cleared all my misconceptions.

crystal clear!

Waiting for more and more from you Prof.

How is second graph is a DAG ? there is a cycle no - X-C-D-P; Also while I am trying to Topologically sort that is the cycle which is not satisfying the constraints. please someone explain :)

nice explanation

Great vid, but one thing that botthered me.
i.e. = that is
Please don't say "i.e."

I wish Professor Sesh Venugopal was my father sometimes. Not in a sexual way. He seems like he has so much life advice to offer, and I want him to give me advice on how to pass data structures, go through college, and land a good ass internship. I want him to tell me how to make friends, how to deal with stress, how to be a good person. Sesh is more nurturing than my own father, and I want more people to realize this without them calling me a gold-digger or calling me kinky or weird.

Thanks for making the video. It's high quality and easy to understand.

isnt topological order the reverse of the pop order of a depth first search algorithm??