title: Number of shortest paths in a graph
body: <p>I need to find the number of all paths between two nodes of a graph by using BFS. I think the answer to my question can be found here:</p>
  
  <p><a href="https://stackoverflow.com/questions/10226251/graph-how-to-find-the-number-of-different-shortest-paths-between-two-vertices">How to find the number of different shortest paths between two vertices, in directed graph and with linear-time?</a> </p>
  
  <p>But I don't quite understand it. Could someone please write the algorithm down in other words so I can understand it better?</p>