Cycle Detection and Path Finding (Graphs: Algorithms & Theory)
In today's lesson, we learn how to detect a cycle in a graph, as well as one way to compute a path given two designated vertices, should it exist!
See if you can find the moth in the video!
Time Stamps:
0:00 Opening
0:44 How to detect a cycle, characterization of a cyclic graph
4:40 Algorithm for cycle detection
11:52 Path finding, how can we find a s-t path?
19:31 Pseudocode for finding a path
25:35 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
#graphtheory