title: Finding all the shortest paths between two nodes in unweighted undirected graph
body: <p>I need help finding all the shortest paths between two nodes in an <em>unweighted undirected graph</em>.   </p>
  
  <p>I am able to find one of the shortest paths using BFS, but so far I am lost as to how I could find and print out all of them. </p>
  
  <p>Any idea of the algorithm / pseudocode I could use?</p>