Topological Sort Algorithm | Graph Theory

How to find the topological sort of a directed acyclic graph

Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube:
https://www.udemy.com/course/graph-theory-algorithms

Shortest path on a Directed Acyclic Graph (DAG):
https://www.youtube.com/watch?v=TXkDpqjDMHA

Github source code link:
https://github.com/williamfiset/algorithms

===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

1) Sublime text, my favorite lightweight code editor (https://www.sublimetext.com).
NOTE: I'm often asked about the color scheme I use, find it here: https://github.com/williamfiset/dotfiles/tree/master/sublime

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
https://www.kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=williamfiset&utm_content=description-only
===============================================================================

0:00 Intro
0:18 Topological sort real life examples
2:49 Technical definition of topsort
3:42 The need for directed acyclic graphs
4:46 Topological ordering of trees
5:26 Topological sort algorithm
9:28 Topological sort source code

Видео Topological Sort Algorithm | Graph Theory канала WilliamFiset