DFS and BFS
Recently had some interesting discussion on algorithms with my friend. We came to the point where question was when to use Depth First Search and when to use Breadth First Search. Not sure about all usages of when to use what. Other then DFS and detection of cycles and DFS maintains Stack and BSF queue what else do you think the situations where these are applicable?