题目:
Shortest Path
1000ms 65536K
描述:
There is a graph with N nodes. Given the length of each edge between the nodes. Find the shortest path from S to E.
输入:
First line: three positive integer number N (N <= 100), S (S <= N), E(E <= N).
Next N lines: the i-th line contains N non-negative integers (<= 100), indicating the length of edge from the i-th node to any nodes.
输出:
One line contains several integers, indicating the indexes of node in the shortest path from S to E.
样例输入:
4 1 4 0 3 6 8 3 0 2 9 6 2 0 2 8 9 2 0
样例输出:
1 2 3 4
翻译:
描述:
有一个有N个节点的表,给出节点之间每条边的长度,求S到E的最短路径。
输入:
第一行:三个正整数N(N<=100),S(S<=N),E(E<=N).
接下来的N行:第i行包含N个非负整数(<=100),表示从第i个节点到任意一个节点的边的长度。
输出:
一行包含几个整数,表示从S到E的最短路径的节点的索引
样例输入:
4 1 4
0 3 6 8
3 0 2 9
6 2 0 2
8 9 2 0
样例输出:
1 2 3 4