Tutorial on Depth-First Search algorithm for graph traversal. Also covers topological sorting using DFS, and parenthesis notation for a graph.
ALGORITHMS
► Dijkstras Intro https://youtu.be/U9Raj6rAqqs
► Dijkstras on Directed Graph https://youtu.be/k1kLCB7AZbM
► Prims MST https://youtu.be/MaaSoZUEoos
► Kruskals MST https://youtu.be/Rc6SIG2Q4y0
► Bellman-Ford https://youtu.be/dp-Ortfx1f4
► Bellman-Ford Example https://youtu.be/vzBtJOdoRy8
► Floyd-Warshall https://youtu.be/KQ9zlKZ5Rzc
► Floyd-Warshall on Undirected Graph https://youtu.be/B06q2yjr-Cc
► Breadth First Search https://youtu.be/E_V71Ejz3f4
► Depth First Search https://youtu.be/tlPuVe5Otio
► Twitter: https://twitter.com/joejamesusa
► Subscribe to my Channel https://www.youtube.com/channel/UC4Xt-DUAapAtkfaWWkv4OAw?view_as=subscriber?sub_confirmation=1
► Thank me on Patreon: https://www.patreon.com/joeyajames
