June 2017
Beginner to intermediate
296 pages
7h 4m
English
We still have to process the v node, which isn't connected to anybody. All we have to do is mark it black, this means that we're done with it. We just have the u and y nodes to go through; obviously, they're not connected to anybody new, so all we have to do is color them black to indicate they have been visited and processed. Finally, we are done:

So, we covered breadth-first-search from a conceptual, algorithmic standpoint. If that didn't make sense, I encourage you to go back through this section to get your head around how the traversals work. It's important that you understand how we actually arrived at the ...
Read now
Unlock full access