How Many Paths Are There(次最短路）

How Many Paths Are There

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 22 Accepted Submission(s) : 10

Problem Description

oooccc1 is a Software Engineer who has to ride to the work place every Monday through Friday. For a long period, he went to office with the shortest path because he loves to sleep late…Time goes by, he find that he should have some changes as you could see, always riding with the same path is boring.
One day, oooccc1 got an idea! Why could I take another path? Tired at all the tasks he got, he got no time to carry it out. As a best friend of his, you’re going to help him!
Since oooccc1 is now getting up earlier, he is glad to take those paths, which are a little longer than the shortest one. To be precisely, you are going to find all the second shortest paths.
You would be given a directed graph G, together with the start point S which stands for oooccc’1 his house and target point E presents his office. And there is no cycle in the graph. Your task is to tell him how long are these paths and how many there are.

Input

There are some cases. Proceed till the end of file.
The first line of each case is three integers N, M, S, E (3 <= N <= 50, 0 <= S , E <N)
N stands for the nodes in that graph, M stands for the number of edges, S stands for the start point, and E stands for the end point.
Then M lines follows to describe the edges: x y w. x stands for the start point, and y stands for another point, w stands for the length between x and y.
All the nodes are marked from 0 to N-1.

Output

For each case,please output the length and count for those second shortest paths in one line. Separate them with a single space.

Sample Input

  
  

   
   3 3 0 2
0 2 5
0 1 4
1 2 2

  
  

Sample Output

  
  

   
   6 1

  
  

Author

ZSTU

Source

HDU 2009-12 Programming Contest

题目大意：给出n，m，beg，end分别表示共有多少个节点，节点间路的的条数，起点，终点

           紧接着m条路 a，b，c分别表示节点a到节点b所需花费c

          求出第二短的花费，及此花费个数

题解：

http://blog.csdn.net/me4546/article/details/6584448