Question

2. This question concerns the graph G shown below. (a) Mark the spanning tree for G obtained by performing a depth-first search starting at the vertex A, and using the convention that nearby vertices should be explored in a counter-clockwise fasion, beginning with east; so E comes first, then NE, then N, ... (b) Mark the spanning tree for G obtained by performing a breadth-first search starting at the vertex A, and using the convention that nearby vertices should be explored in a counter-clockwise fasion, beginning with east; so E comes first, then NE, then N, ... Place work in this bor. Continue on back if needed. (a) You may draw your spanning tree directly on the graph G. H E F A B (b) You may draw your spanning tree directly on the graph G. H D E F A B

Answer 1

Aܢܘܥܢܘ print the Depth - first search Algaithm function that takes the intex of node Steps: create reculleran and whited Stap 2: Mark. The Curent node as verited and odle Steps Provene all the adjacent & unmarked noder and call the recurve function with index of adjacent node Given graph شد start at node A as root node and exploes Por as parible along brancher before back tracking Pranvased nade stack Find adjacency node adjacent node B A BD Coa BE ABER 857 6 sa JawbGFE FI HI Delt F I empt FH Question (b) same or Quation ca) there fore solution will be Same ou part (a)