Question

solve for (B) only. the last number of my index number is "5" thank you

4. Using the graph below, o 8 9 3 7 6 4 5 a. Draw an adjacency list and matrix.[10 MARKS] b. Perform a depth first search using THE LAST VALUE OF YOUR INDEX NUMBER AS THE SOURCE as your source and draw the resulting depth first search tree [10 MARKS]

Answer 1

DFS traversal order:

5 3 1 2 4 8 0 9 7 6

Explanation with the tree is given below. Tree generation is shown stepwise. Step 10 contains the finally generated DFS tree.
Step 4: visit vertex a add vertex I to stack ont of SOLUTION y Apresenti Step 1: Start with vertex 5 and explore vertex 5 5 Sofia Visited : 5 Blond Stack: Step 2: Visit vertex 3 add vertex 3 as visited push veutex 5 to the stack and explore verdex 3 2011 to. Vistited : 5,3 3 Stack: 5 Step 3: Visit verdex I add vertex 3 to the Stack and readex I as visited (5) Visited: 5, 3, 1 Stack: 5,3 @@@ 1 and veutex a as visited Visited: 5,3,1,2 Stack: 5,3, I

Step 5: Visit vertex 4 add vendex a to the Stack and verdey 4 vertex e as visited 5 ) Visited a 5.3. 1, 2, 4 Stack :9312 ②-③-④- Step & Pop rendex 2 and visit it since ventex 4 was the last veutex and all other vendices are visited Hence & Explore vertex. 8, add it as visited from it ) Visited: 5, 3, 1, 2, 4, 8 Stacka 9 31 y xotion bbo 6 B 8 tie 6 Środiny 1.1 - 2

Step 7o Explore verder 8 ie, visit vertex o add it as visited and push verter 8 to the (5 visited: 5, 3, 1, 2, 4, 8,0 Stack: 5,3 1,8 Step 8 Pop veldex 8 and visit verdex a and mark it as visited from 66 - 3 visited: 5,3,1,3,4,8,0,9 - Stack: 5, 3, ' 9 പരിപ്പിൽ മതി. ക Wood go

Step 98 Pop vertex I and visit vertex 7 and mark it as visited 5 Visited a 5,3,1,2,4,8,0 9,7 Stack: 5,3 7 ( 9 Step 10: Explose vertex it le visit verdex 6 and mark it as visited and add vendex 7 to the stack. 5 (3) Visited: 5,3,1,2,4,8,0,9,76 Stack: 5,3,7 8 final solution Step ni Pop all the elements of the Stack.

Please upvote if you like the effort.