Topological Ordering of Graphs

thank you so much, you saved me! :D

Thanks mam learning from India .

thanks, professor!

really good! thanks

what if we have 3 vertices having 0 in degree in the initial step?

Namaste 🙏 Teacher

I just can't help but think that this particular implementation might be kinda expensive?? O(N^2)??

wow...

It's amazing how you made it look like so simple. Accurate and precise explanation. Thanks a lot professor.

I think it's worth mentioning that the reason that all the examples you mentioned are directed and acyclic is that time is the common factor between them. I struggle to think of a practical application of DAGs that isn't specifically a DAG because of time.

Great video, thanks!

Great explanation. Thank you Professor!

This is by far the best video I watched on this topic, thank you!