杨辉三角与最短路线问题

Pascal's Triangle and the Shortest Road

在纷繁错杂的交通网中,从一点到另一点有很多条路,而最短路线的条数是如何计算的,利用杨辉三角是一种简便的方法。

s:There are a number of roads leading to a certain destination and there are several shortest ones among them. Then comes the question: How can we calculate the number of the shortest roads.There is a simple solution given in the article below.