Algorithms and Datastructures

BFS and DFS are two primary graph traversal algorithms that we have discussed in the class. As we have discussed, we can use both DFS and BFS in developing web crawling applications.

a) Briefly explain how you can use BFS in developing web crawling applications.

b) Briefly explain how you can use DFS in in developing web crawling applications.

c) Compare and contrast the two techniques described in (a) and (b) above highlighting applicability, strengths, and weaknesses of each approach.