其他分享
首页 > 其他分享> > 英文翻译7

英文翻译7

作者:互联网

OpenJudge - 07:Shortest Path

描述

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,S,E。

接下来的N行:第i行有N个非负整数,表明从第i个节点到任意节点的距离。

输出:

一行包括几个整数,表明从S到E的最短节点路径。

标签:英文翻译,contains,节点,path,line,nodes,shortest
来源: https://blog.csdn.net/fsy_and_zxc/article/details/122658345