Course Solutions Uncategorized (Solved) : 5 Marks Suppose Digraph G V E Sets V 1 2 3 4 5 6 7 Nodes E 1 3 2 1 2 3 3 7 4 7 5 4 6 4 Q29431684 . . . .

(Solved) : 5 Marks Suppose Digraph G V E Sets V 1 2 3 4 5 6 7 Nodes E 1 3 2 1 2 3 3 7 4 7 5 4 6 4 Q29431684 . . . .

 

(5 marks) Suppose a digraph G (V, E) below with the sets V 1,2,3,4,5,6,7 of nodes and E-((1,3), (2, 1),(2,3).(3,7),(4,7),(5,4).(6,4). (6,5).(7,2).(7,6) of arcs:4. (5 marks) Suppose that the depth-first search algorithm DFS is run on a digraph G = (V, E) from question 1. The DFS starts at the node 1 and selects either a next adjacent node, or a next tree root in the search forest in ascending numerical order (a) Compute seenlu] and donelu] for all the nodes v EV 1,2,3,4,5,6,7 (b) Classify each arc e E as a tree arc (ta) in the DFS forest, or a forward arc (fa), or a cross arc (ca), or a back arc (ba); justify your classification, and tabulate the arcs and C7.3 where Ce E ta, ta, ca, ba

(5

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post