title: Using Boost's graph breadth_first_search() to find a path in an unweighted, undirected graph
body: <p>I'm using an adjacency_list graph, with undirected and unweighted edges. I need to find a shortest path between vertex u and vertex v.
  Should I use breadth_first_search() starting from u? When reaching v, how do I obtain the path, and how do I stop the search?</p>
  
  <p>thanks!</p>