title: Advantage of depth first search over breadth first search or vice versa
body: <p>I have studied the two graph traversal algorithms,depth first search and breadth first search.Since both algorithms are used to solve the same problem of graph traversal I would like to know how to choose between the two.I mean is one more efficient than the other or any reason why i would choose one over the other in a particular scenario ?</p>
  
  <p>Thank You</p>