Counting Reachable Vertices and Edges (Graphs: Algorithms & Theory)

Channel:

PageWizard Games, Learning & Entertainment

Subscribers:

785

Published on October 3, 2022 4:00:18 PM ● Video Link: https://www.youtube.com/watch?v=b3VP3yQir14

Duration: 21:16

19 views

0

In today's lesson, we learn how, using DFS or BFS, we can count vertices or edges belonging to a connected component of some starting/source vertex.

Time Stamps:
0:00 Opening and recap
1:10 Observations for today's lesson
1:49 Counting vertices
10:39 Counting edges
20:55 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