SPFA求最短路
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N = 1e5 + 5;
int n,m;
int h[N],ne[N],val[N],w[N],vis[N],dist[N],idx;
queue<int> q;
void add(int a,int b,int x)
{
val[idx] = b;
ne[idx] = h[a];
w[idx] = x;
h[a] = idx++;
}
int spfa()
{
memset(dist,0x3f,sizeof dist);
dist[1] = 0;
q.push(1);
vis[1] = 1;
while(q.size())
{
int t = q.front();
vis[t] = 0;
q.pop();
for(int i = h[t];i!=-1;i=ne[i])
{
int j=val[i];
if(dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
if(!vis[j])
{
q.push(j);
vis[j]=1;
}
}
}
}
return dist[n];
}
int main()
{
cin>>n>>m;
memset(h,-1,sizeof h);
while(m--)
{
int a,b,x;
cin>>a>>b>>x;
add(a,b,x);
}
if(spfa()==0x3f3f3f3f) cout<<"impossible";
else cout<<dist[n];
return 0;
}
SPFA求负环
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N = 1e5 + 5;
int n,m;
int h[N],ne[N],val[N],w[N],vis[N],dist[N],cnt[N],idx;
queue<int> q;
void add(int a,int b,int x)
{
val[idx] = b;
ne[idx] = h[a];
w[idx] = x;
h[a] = idx++;
}
int spfa()
{
memset(dist,0x3f,sizeof dist);
dist[1] = 0;
for(int i=1;i<=n;i++) q.push(i);
vis[1] = 1;
while(q.size())
{
int t = q.front();
vis[t] = 0;
q.pop();
for(int i = h[t];i!=-1;i=ne[i])
{
int j=val[i];
if(dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
cnt[j] = cnt[t] + 1;
if(cnt[j] >= n) return 1;
if(!vis[j])
{
q.push(j);
vis[j]=1;
}
}
}
}
return 0;
}
int main()
{
cin>>n>>m;
memset(h,-1,sizeof h);
while(m--)
{
int a,b,x;
cin>>a>>b>>x;
add(a,b,x);
}
if(spfa()) cout<<"Yes";
else cout<<"No";
return 0;
}