Question: QUESTION 3 (10 MARKS) (a) Given the graph D F B E (i) Determine whether the graph has an Euler trail. Construct the Euler trail

QUESTION 3 (10 MARKS) (a) Given the graph D F B E (i) Determine whether the graph has an Euler trail. Construct the Euler trail if exists or explain why if it doesn't have one. [2.5 marks] F B E (ii ) Use the breadth first search algorithm to find a spanning tree in the above graph. Assume vertex E is the root and the selection of next vertex follows the alphabetical order if more than one choices. Show clearly each step of how the algorithm is performed. Then draw the spanning tree. [4.5 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
