图论各类算法与题目

853.有边数限制的最短路
https://www.acwing.com/problem/content/855/

//https://www.acwing.com/problem/content/855/
#include<bits/stdc++.h>
using namespace std;
const int N=505;
struct edge{
    int x,y,z;
}e[10005];
int dist[N],last[N];
int n,m,k,x,y,z;
void bellman_ford(){
    for(int i=1;i<=k;i++){
        memcpy(last,dist,sizeof(dist));
        for(int i=1;i<=m;i++){
            dist[e[i].y]=min(dist[e[i].y],last[e[i].x]+e[i].z);
        }
    }
}
int main(){
    cin>>n>>m>>k;
    memset(dist,0x3f,sizeof(dist));
    dist[1]=0;
    for(int i=1;i<=m;i++)cin>>e[i].x>>e[i].y>>e[i].z;
    bellman_ford();
    if(dist[n]>0x3f3f3f3f/2)cout<<"impossible"<<endl;
    else cout<<dist[n]<<endl;
}

852.spfa判断负环
https://www.acwing.com/problem/content/854/
就用spfa将所有点进入，之后不断松驰，同时记录下松驰到这个点时的最短路需要几步，如果这个最短路长度>=n，则必定有负环。

//https://www.acwing.com/problem/content/854/
#include<bits/stdc++.h>
using namespace std;
const int N=2005;
struct edge{
    int n,o,l;
}e[10005];
int last[N],dist[N],flag[N],cnt[N];
int w,n,m,x,y,z;
void add_edge(int x,int y,int z){
    w++;e[w].n=last[x];last[x]=w;e[w].o=y;e[w].l=z;
}
int spfa(){
    memset(dist,0x3f,sizeof(dist));
    for(int i=1;i<=n;i++)flag[i]=1;
    memset(cnt,0,sizeof(cnt));
    queue<int>q;
    for(int i=1;i<=n;i++)q.push(i);
    while(q.size()){
        int x=q.front();
        if(cnt[x]>=n)return 0;
        q.pop();
        flag[x]=0;
        for(int w1=last[x];w1;w1=e[w1].n){
            int y=e[w1].o;
            if(dist[x]+e[w1].l<dist[y]){
                dist[y]=dist[x]+e[w1].l;
                cnt[y]=cnt[x]+1;
                if(flag[y]==0){
                    flag[y]=1;
                    q.push(y);
                }
            }
        }
    }
    return 1;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>z;
        add_edge(x,y,z);
    }
    bool ok=spfa();
    if(ok==0)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}