title: How to find all shortest paths
body: <p>I have a graph and I want to find all shortest paths between two nodes. I've found a shortest path between two nodes by BFS. However, it just gives me one of the shortest paths if there exists one more than. </p>
  
  <p>How could I get all of them using BFS?</p>
  
  <p>I've implement my code from well-known BFS pseudocode.<br>
  Also, I have a adjacency list vector which holds adjacency vertices for all nodes.</p>