bellman_ford算法（求最短路）

 题目：

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 100010;
int n,m,k;
struct
{
	int a,b,w;
}ed[N];
int dist[N],backup[N];//用结构体存放图 

int bellman_ford()//算法过程 
{
	
	for(int i = 0;i < k;i++)//迭代k次，表示走了k次，从而得到结果 
	{
		memcpy(backup,dist,sizeof dist);//备份，以免照成多次迭代 
		
		
		for(int j = 1;j <= m;j++)
		{
			int a = ed[j].a;
			int b = ed[j].b;
			int w = ed[j].w;
			if(dist[b] > backup[a] + w)
			{
				dist[b] = backup[a] + w;
			 } //更新dist的值 
		}
	}
	if(dist[n] > 0x3f3f3f/2)return -1;
	else return dist[n];
}



int main()
{
	cin>>n>>m>>k;
	
	memset(dist,0x3f,sizeof dist);
	dist[1] = 0;
	for(int i = 1;i <= m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		ed[i].a = a;
		ed[i].b = b;
		ed[i].w = c;
	}
	int t = bellman_ford();
	if(t == -1)cout<<"imposible"<<endl;
	else cout<<t<<endl;
	return 0;
}