针对有向图,求经过点s的最小环,只需要用点s松弛后再把dis[s]=inf,然后下一次取到点s后,dis[s]就是经过点s的最小环
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int inf=0x3f3f3f3f;
int head[1005],nxt[2000005],to[2000005],wei[2000005],dis[1005],vis[1005],price[1005],cnt=1,n,m;
void add(int u,int v,int w){
nxt[++cnt]=head[u];
to[cnt]=v;
head[u]=cnt;
wei[cnt]=w;
}
struct node{
int p,d;
bool operator < (const node& other)const{
return d>other.d;
}
bool operator > (const node& other)const{
return d<other.d;
}
};
priority_queue<node> q;
int ans=0x3f3f3f3f;
void solve(int s){
while(!q.empty())q.pop();
dis[s]=0;
q.push((node){s,0});
bool flag=true;
while(!q.empty()){
node top=q.top();
q.pop();
int u=top.p;
if(vis[u])continue;
vis[u]=true;
for(int i=head[u];i;i=nxt[i]){
int v=to[i];
if(dis[v]>dis[u]+wei[i]+price[v]){
dis[v]=dis[u]+wei[i]+price[v];
q.push((node){v,dis[v]});
}
}
if(flag){
flag=false;
dis[s]=inf;
vis[s]=false;
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&price[i]);
}
for(int i=1;i<=m;i++){
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
add(u,v,w);
}
memset(dis,0x3f,sizeof dis);
solve(1);
ans=dis[1];
if(ans==inf){
puts("-1");
}else{
printf("%d\n",ans);
}
return 0;
}
这里有点权,也差不多处理,注意重复叠加的问题