Question: 2. (12 pts.) DFS basics A B 1 H Run DFS starting from node A, trying to visit nodes alphabetically (e.g. given a choice between

 2. (12 pts.) DFS basics A B 1 H Run DFS

2. (12 pts.) DFS basics A B 1 H Run DFS starting from node A, trying to visit nodes alphabetically (e.g. given a choice between nodes D and F. visit D first). (a) List the nodes in the order you visit them (so each node should appear in the ordering exactly once). (b) List each node with its pre- and post-number. The numbering starts from 1 and ends at 18. (c) Label each edge as Tree, Back, Forward or Cross

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!