Given a graph and a source node and destination node, find the number of shortest paths present between source and destination?