1. Analyse the graph shown in Figure 2 using the breadth-first search tree traversal algorithm. Show the step-by-step traversal of the algorithm. Assume that the traversal starts from vertex A. [10 marks]

    

2.   
3. ch pseudocode that was used to traverse the graph in Figure2. You may present your answer in the form of a pseudocode. [10 marks]
4. 
   

5. Distinguish between the breadth-first search and depth-first search tree traversal algorithms. [5 marks]

Transcribed Image Text:

A D B E с TI F A D B E с TI F

Answer rating: 100% (QA)

Pseudocode for breadthfirst search tree traversal algorithm Stepbystep traversal of the graph in Fig... View the full answer