#Simple Graph Question
6 messages · Page 1 of 1 (latest)
if its depth 2, then
depth 1 = 3,6 (nodes connecting to 7)
depth 2 = 1,2,4,5 (nodes connecting to 3 and 6)
because BFS is level order, we are exploring each vertex, so:
- find the nodes connecting to 7 = starting node (depth 1) = 3,6
2)find the nodes connecting to 3,6 (depth 2)
I think this is a pretty easy topic but if I explained it it would be hard to understand, so it will be better to watch a video on BFS.
Breadth First Search
Depth First Search
PATREON : https://www.patreon.com/bePatron?u=20475192
Courses on Udemy
Java Programming
https://www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6
Data Structures using C and C++
https://www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D...
bro did u get it