Exploring a Graph: Depth-First Search (Graphs: Algorithms & Theory)
In today's lesson we see how we can explore a graph, using story of Theseus and the Minotaur as an overly juicy-detailed angle to maze-solving! Enjoy! We'll go over more details in the future.
Time Stamps
0:00 Opening, what is a graph traversal and reachability?
6:36 Primer to Depth-First Search, Dan tells a story about Theseus and the Minotaur
15:07 Edge labels as a result of depth-first search, what is the "string"? A stack! An example.
26:19 Depth-First Search
32:04 Time complexity
51:22 How do we adapt DFS(u) to process the whole graph, regardless?
56:40 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithms
#GraphAlgorithms