最短路径问题
题目描述:
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。
输入:
输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点t。n和m为0时输入结束。
(1
code
#include<iostream>
using namespace std;
//边的相关信息
int Edge_Length[1001][1001];
int Edge_Cost[1001][1001];
int main()
{
int n, m;
while (cin >> n >> m && n > 0 && m > 0)
{
//初始化
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
Edge_Length[i][j] = -1;
Edge_Cost[i][j] = 0;
}
Edge_Length[i][i] = 0;
}
//输入数据
int a, b, d, p; //两点、边长、花费
while (m-- > 0)
{
cin >> a >> b >> d >> p;
Edge_Length[a][b] = d;
Edge_Cost[a][b] = p;
}
//Floyed
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (Edge_Length[i][k] == -1 || Edge_Length[k][j] == -1)
continue;
if (Edge_Length[i][j] == -1 || Edge_Length[i][k] + Edge_Length[k][j] < Edge_Length[i][j])
{
Edge_Length[i][j] = Edge_Length[i][k] + Edge_Length[k][j];
Edge_Cost[i][j] = Edge_Cost[i][k] + Edge_Cost[k][j];
}
}
}
}
int s, t; //起点、终点
cin >> s >> t;
cout << Edge_Length[s][t] << " " << Edge_Cost[s][t] << endl;
}
return 0;
}