Towards Efficient Shortest Path Counting on Billion-Scale Graphs