Question
DFS has to be alphabeltical

DPS 7 t4 7
0 0
Add a comment Improve this question Transcribed image text
Answer #1

DFS will access the vertices such that from vertex u, it will select any of the neighboring vertex of u which has not been discovered and since we will discover that neighbour of u which has not been explored and having least alphabetical order. So the order of visiting vertices as per DFS in above graph will be

a b c d g f e h

Note the in this order we have maintained alphabetical order.

Please comment for any clarification.

Add a comment
Know the answer?
Add Answer to:
DFS has to be alphabeltical DPS 7 t4 7 DPS 7 t4 7
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT