Graph Data Structure 3. Traversing a Graph (algorithms)
This is the third in a series of videos about the graph data structure, including how to search a graph by systematically by visiting each and every vertex, namely, how to traverse a graph. Depth first traversal is compared with breadth first traversal, including explanations of how depth first traversal can make use of a stack data structure, and how breadth first traversal can make use of a queue data structure.
On this page of the site you can watch the video online Graph Data Structure 3. Traversing a Graph (algorithms) with a duration of hours minute second in good quality, which was uploaded by the user Computer Science Lessons 10 April 2016, share the link with friends and acquaintances, this video has already been watched 31,678 times on youtube and it was liked by 724 viewers. Enjoy your viewing!
