Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory)

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
785
Published on ● Video Link: https://www.youtube.com/watch?v=EWD1hIg36kM


Duration: 16:30
20 views
3

Hello everybody! Today we learn how we can use a DFS/BFS tree to compute paths where the root of the DFS/BFS tree is one end of the path (the source). The principle applies regardless if it you use a DFS traversal or a BFS traversal.

Time Stamps:
0:00 Recap from a previous lesson.
3:38 Idea
7:47 Algorithm
16:10 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



Other Videos By PageWizard Games, Learning & Entertainment


2022-10-17Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory)
2022-10-14Introduction to Mathematical Sequences, and How to Derive a Sequence
2022-10-14Dan Plays Legend of Zelda: Link's Awakening DX
2022-10-12Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory)
2022-10-11Minimum Spanning Trees and the Cut Property, Taking Your Questions!
2022-10-10Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory)
2022-10-07Computing Connected Components of a Graph (Graphs: Algorithms & Theory)
2022-10-06Dan Plays Legend of Zelda: Link's Awakening DX (GB Colour, COME JOIN THE FUN!)
2022-10-05Testing Connectivity of a Graph (Graphs: Algorithms & Theory)
2022-10-03Counting Reachable Vertices and Edges (Graphs: Algorithms & Theory)
2022-09-30Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory)
2022-09-29Special: Lessons & Goodbye for Lola (Our First Computer Program/Complexity Analysis)
2022-09-28DFS/BFS Trees are Indeed Acyclic (Graphs: Algorithms & Theory)
2022-09-26Breadth-First Search (Graphs: Algorithms & Theory)
2022-09-23Smashing The Genie in Legend of Zelda: Link's Awakening [Gameboy Colour]
2022-09-23Cycle Detection and Path Finding (Graphs: Algorithms & Theory)
2022-09-22Learn & Have Fun [Sequences, Summations, Induction, Legend of Zelda: Link's Awakening DX]
2022-09-21Exploring a Graph: Depth-First Search (Graphs: Algorithms & Theory)
2022-09-21Graph/Networks and Minimum Spanning Trees, Algorithms and More!
2022-09-19I'm Number One, ha HA [with my Narwal friend]
2022-09-19How to Represent a Graph (Graphs: Algorithms & Theory)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
graph traversal
graph theory
algorithms
DFS
BFS
tree
forest
path finding
path
walk
cycle