最短路问题code 记忆版

#include<iostream>
#include<cstring>
#include<queue>
typedf pair<int,int> PII;
//o(n^2)
int dijkstra()
{
	memset(dist,0x3f,sizeof dist);
	dist[1]=0;
	
	for(int i=0;i<n;i++)
	{	
		int t=-1;
		for(int j=1;j<=n;j++)
		{
			if(!st[j]&&(t==-1||dist[j]<dist[t]) t=j;
		}
		st[t] = true;
		for(int j=1;j<=n;j++)
		{
			dist[j] = min(dist[j],dist[t]+g[t][j]);
		}
	}
	if(dist[n]==0x3f3f3f3f) return -1;
	else return dist[n];
}
//O(mlogn)
int dijkstra_up()
{
	memset(dist,0x3f,sizeof dist);
	dist[1] = 0;
	
	priority_queue<PII,vector<PII>,greater<PII>> q;
	q.push({0,1});
	
	while(q.size())
	{
		auto t = q.top();//注意auto 
		q.pop();
		int ver = t.second,distance = t.first;
		
		if(st[ver]) continue;
		else st[ver]=true;
		
		for(int i=h[ver];i!=-1;i=ne[i])
		{
			int j=e[i];
			if(dist[j]>distance+w[i])
			{
				dist[j] = distance +w[i];
				q.push(dist[j],j);
			}
		} 
	}
	if(dist[n]==0x3f3f3f3f) return -1;
	else return dist[n];
} 

//O(nm)
int bellman_ford()
{
	memset(dist,0x3f,sizeof dist);
	dist[1]=0;
	
	for(int i=0;i<k;i++)
	{
		memcpy(backup,dist,sizeof dist);
		for(int j=1;j<=m;j++)
		{
			int a=edges[j].a,b=edges[j].b,w=edges[j].w;
			dist[b] = min(dist[b],backup[a]+w);
		}
	}
	if(dist[n]>0x3f3f3f3f/2) return -1;
	else return dist[n]; 
}

//好O(m) 坏O(nm) 
int spfa()
{
	memset(dist,0x3f,sizeof dist);
	dist[1] = 0;
	
	queue<int> q;
	q.push(1);
	st[1]=true;
	
	while(q.size())
	{
		int t = q.front();
		q.pop();
		st[t] = false;
		
		for(int i=h[t];i!=-1;i=ne[i])
		{
			int j = e[i];
			if(dist[j]>dist[t]+w[i])//注意是dist【t】 
			{
				dist[j]=dist[i]+w[i];
				if(!st[j])
				{
					q.push(j);
					st[j]=true;
				} 
			}
		}
	}
	if(dist[n]==0x3f3f3f3f) return -1;
	else return dist[n];
}

//spfa 判断负环
bool spfa()
{
	//判断存不存在负环，不用初始化也ok 
	queue<int> q;
	//要把每个点入队，可能第一个点到不了负环 
	for(int i=0;i<n;i++)
	{
		st[i] = true;
		q.push(i);
	}
	
	while(q.size())
	{
		int t =q.front();
		q.pop(t);
		st[t] = false;
		
		for(int i=h[t];i!=-1;i=ne[i])
		{
			int j=e[i];
			if(dist[j]>dist[t]+w[i])
			{
				dist[j]=dist[t]+w[i];
				cnt[j] = cnt[t]+1;
				if(cnt[j]>=n) return true;//存在 
				if(!st[j])
				{
					q.push(j);
					st[j]=true;	
				}	
			}	
		}	
	} 
	return false;//不存在 
} 

//解决多源点 O(n^3) 
void floyd()
{
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				dist[i][j]=min(dist[i][k]+dist[k][j]);
}