http://noi.openjudge.cn/english/07/
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.
最短路径
描述
有一幅图具有N个节点。给定节点之间每条边的长度。找到从S到E的最短路径。
输入：
第一行：三个正整数N (N <= 100), S (S <= N), E(E <= N).
接下来N行：第i行包括N个非负整数（<=100）,表示第i个节点到任意行节点的长度。
输出：
一行包括若干整数，表示从S到E最短路径节点的索引。