通过读入的输入文件来判断开始点到终止点之间的最短路以及此图是否为有向无环图-You will read　the standard input a descr iption of a graph and then report two things on that graph:

1. The shortest path between a source node and a destination node specified in the input.

2. Whether the graph is a directed acyclic graph (DAG).