graph - How to find the number of different shortest paths between two vertices, in Directed Graph and with linear-time?
How to find the number of different shortest paths between two vertices, in directed graph and with linear-time?