Question: For the following graph using Depth First Search (DFS) and Breadth First Search (BFS) technique, respectively: a b C e d f g h
For the following graph using Depth First Search (DFS) and Breadth First Search (BFS) technique, respectively: a b C e d f g h k (i) List the vertices that are visited starting at vertex 'a'. (6 marks) (ii) According to the traversal order from (i), sketch Depth First Spanning tree (DFT) and Breadth First spanning tree (BFT).
Step by Step Solution
There are 3 Steps involved in it
BFS ie Breath First Search the nodes is traversed from a given starting node and one by one the neighbour node of the starting node which is not visited is taken and inserted into the queue and if it ... View full answer
Get step-by-step solutions from verified subject matter experts
