00:01
First we need to represent the graph using adjacency list.
00:10
So, however, without a specific graph provided, i can't provide the adjacency list.
00:14
Generally, an adjacency list for a graph is a collection of unordered lists for one for each vertex in the graph.
00:34
Each list describes the set of neighbors of vertex in graph.
00:47
So, for a breadth -first search bfs, we start at the root and explore the neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
01:03
The bfs traversal of the graph would be represented by the order in which the nodes are visited.
01:11
However, without a specific graph, we can't provide the bfs traversal.
01:19
So, for depth -first search, we can start at the root and explore as far as possible along each branch before backtracking...