最短路 SPEA

裸最短路 练模板

HDU-2544 

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 105;
const int inf = 1<<30;
typedef __int64 LL;
int n,m,pos;
struct node
{
	int to,w,next;
}edge[maxn*maxn];
int head[maxn],dis[maxn],outq[maxn];
bool inq[maxn];
void addEdge( int u,int v,int w )
{
	edge[++pos].to = v; edge[pos].w = w;
	edge[pos].next = head[u]; head[u] = pos; 
}
bool SPEA( int s )
{
	queue<int>que;
	memset( inq,0,sizeof(inq) );
	memset( outq,0,sizeof(outq) );
	for( int i = 0; i <= n; i ++ )	dis[i] = inf;
	dis[s] = 0;
	que.push(s);
	while( !que.empty() )
	{
		int u = que.front();  que.pop();
		outq[u] ++;
		if( outq[u] > n )
			return false;
		inq[u] = false;
		for( int i = head[u]; i != -1; i = edge[i].next )
		{
			node &v = edge[i];
			if( dis[v.to] > dis[u] + v.w ){
				dis[v.to] = dis[u] + v.w;
				if( !inq[v.to] ){
					que.push(v.to);
					inq[v.to] = true;
				}
			}
		}
	}
	return true;
}
int main()
{
	//freopen("data.txt","r",stdin);
	int u,v,w;
	while( scanf("%d%d",&n,&m) != EOF,n+m )
	{
		pos = 0;
		memset( head,-1,sizeof(head) );
		for( int i = 0; i < m; i ++ ){
			scanf("%d%d%d",&u,&v,&w);
			addEdge( u,v,w );
			addEdge( v,u,w );
		}
		if( SPEA(1) )
			printf("%d\n",dis[n]);
		else
			puts("图中存在负权回路");
	}
	return 0;
}

POJ-3259

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 505;
const int inf = 1<<30;//0x7f;
typedef __int64 LL;
int n,m,w,pos;
struct node
{
	int to,w,next;
}edge[maxn*12];
int head[maxn],dis[maxn],outq[maxn];
bool inq[maxn];
void addEdge( int u,int v,int w )
{
	edge[++pos].to = v; edge[pos].w = w;
	edge[pos].next = head[u]; head[u] = pos;
}
bool SPFA( int s )
{
	queue<int>que;  
    memset( inq,0,sizeof(inq) );  
    memset( outq,0,sizeof(outq) );  
	for( int i = 0; i <= n; i ++ )	dis[i] = inf;
	dis[s] = 0;
	que.push(s);
	while( !que.empty() )
	{
		int u = que.front(); que.pop();
		outq[u] ++;
		if( outq[u] > n )	return true;
		inq[u] = false;
		for( int i = head[u]; i != -1; i = edge[i].next )
		{
			node &v = edge[i];
			if( dis[v.to] > dis[u] + v.w ){
				dis[v.to] = dis[u] + v.w ;
				if( !inq[v.to] ){
					inq[v.to] = true;
					que.push( v.to );
				}
			}
		}
	}
	return false;
}
int main()
{
	#ifndef ONLINE_JUDGE
    freopen("data.txt","r",stdin);
	#endif
	int cas,u,v,t;
	scanf("%d",&cas);
	while( cas -- )
	{
		pos = 0;
		memset( head,-1,sizeof(head) );
		scanf("%d%d%d",&n,&m,&w);
		for( int i = 0; i < m; i ++ )
		{
			scanf("%d%d%d",&u,&v,&t);
			addEdge(u,v,t);	
			addEdge(v,u,t);
		}
		for( int i = 0; i < w; i ++ )
		{
			scanf("%d%d%d",&u,&v,&t);
			addEdge(u,v,-t);
		}
		if( SPFA(1) )
			puts("YES");
		else
			puts("NO");
	}
    return 0;
}