水题拿来敲代码用 一些细节还是不是很熟悉 敲的还是太慢了
Dijstra + 优先队列:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
const int maxn = 205;
const int inf = 1<<28;
int n,m;
int map[maxn][maxn],dis[maxn];
bool vis[maxn];
typedef pair<int,int>pii;
void Dijstra( int x )
{
priority_queue<pii,vector<pii>,greater<pii> >que;
memset( vis,0,sizeof(vis) );
for( int i = 0; i < n; i ++ )
dis[i] = inf;
dis[x] = 0;
que.push( make_pair(dis[x],x) );
while( !que.empty() )
{
pii u = que.top(); que.pop();
int v = u.second;
if( vis[v] )
continue;
vis[v] = true;
for( int i = 0; i < n; i ++ )
{
if( map[v][i] != inf && dis[i] > dis[v] + map[v][i] )
{
dis[i] = dis[v] + map[v][i];
que.push( make_pair( dis[i],i ) );
}
}
}
}
int main()
{
//freopen( "data.in","r",stdin );
int a,b,c;
while( scanf("%d%d",&n,&m) != EOF )
{
for( int i = 0; i < n; i ++ )
{
for( int j = 0; j < n; j ++ )
{
map[i][j] = inf;
}
}
for( int i = 1; i <= m; i ++ )
{
scanf("%d%d%d",&a,&b,&c);
if( c < map[a][b] )
map[a][b] = map[b][a] = c;
}
scanf("%d%d",&a,&b);
Dijstra(a);
if( dis[b] == inf )
puts("-1");
else
printf("%d\n",dis[b]);
}
return 0;
}
Floyd:
#include<stdio.h>
#include<string.h>
const int maxn = 205;
const int inf = 1<<28;
int n,m;
int dis[maxn][maxn];
void Floyd()
{
for( int k = 0; k < n; k ++ )
{
for( int i = 0; i < n; i ++ )
{
for( int j = 0; j < n; j ++ )
{
if( dis[i][j] > dis[i][k] + dis[k][j] )
dis[i][j] = dis[i][k] + dis[k][j];
}
}
}
}
int main()
{
//freopen( "data.in","r",stdin );
int a,b,c;
while( scanf("%d%d",&n,&m) != EOF )
{
for( int i = 0; i < n; i ++ )
{
for( int j = 0; j < n; j ++ )
{
if( i == j )
dis[i][j] = 0;
else
dis[i][j] = inf;
}
}
for( int i = 1; i <= m; i ++ )
{
scanf("%d%d%d",&a,&b,&c);
if( c < dis[a][b] )
dis[a][b] = dis[b][a] = c;
}
Floyd();
scanf("%d%d",&a,&b);
if( dis[a][b] == inf )
puts("-1");
else
printf("%d\n",dis[a][b]);
}
return 0;
}
BellmanFord:
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 210;
const int inf = 1<<29;
int n,m;
int dis[maxn];
struct node
{
int id,w;
node( int a,int b ) { id = a; w = b; }
};
vector<node>map[maxn];
bool BellmanFord( int s )
{
for( int i = 0; i < n; i ++ )
dis[i] = inf;
dis[s] = 0;
for( int i = 0; i < n-1; i ++ ) //n-1次松弛
{
for( int j = 0; j < n; j ++ )
{
if( dis[j] == inf )
continue;
for( int k = 0; k < map[j].size(); k ++ )
{
node u = map[j][k];
if( u.w != inf && dis[u.id] > dis[j] + u.w )
dis[u.id] = dis[j] + u.w;
}
}
}
for( int j = 0; j < n; j ++ )
{
if( dis[j] == inf )
continue;
for( int k = 0; k < map[j].size(); k ++ )
{
node u = map[j][k];
if( u.w != inf && dis[u.id] > dis[j] + u.w )
return false;
}
}
return true;
}
int main()
{
//freopen("data.txt","r",stdin);
int a,b,c;
while( scanf("%d%d",&n,&m) == 2 )
{
for( int i = 0; i <= n; i ++ )
map[i].clear();
for( int i = 1; i <= m; i ++ )
{
scanf("%d%d%d",&a,&b,&c);
map[a].push_back( node(b,c) );
map[b].push_back( node(a,c) );
}
scanf("%d%d",&a,&b);
if( BellmanFord( a ) )//判断是否有负环
{
if( dis[b] != inf )
printf( "%d\n",dis[b] );
else
puts("-1");
}
}
return 0;
}
//SPEA
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 210;
const int inf = 1<<29;
int n,m;
int dis[maxn],outque[maxn],vis[maxn];
struct node
{
int id,w;
node( int a,int b ) { id = a; w = b; }
};
vector<node>map[maxn];
bool SPEA( int s )
{
queue<int>que;
memset( outque,0,sizeof(outque) );
memset( vis,0,sizeof(vis) );
for( int i = 0; i < n; i ++ )
dis[i] = inf;
dis[s] = 0;
que.push( s );
vis[s] = true;
while( !que.empty() )
{
int x = que.front(); que.pop();
vis[x] = false;
outque[x] ++;
if( outque[x] > n )
return false;
for( int i = 0; i < map[x].size(); i ++ )
{
node u = map[x][i];
if( u.w != inf && dis[u.id] > dis[x] + u.w )
{
dis[u.id] = dis[x] + u.w;
if( !vis[u.id] )
{
vis[u.id] = true;
que.push( u.id );
}
}
}
}
return true;
}
int main()
{
//freopen("data.txt","r",stdin);
int a,b,c;
while( scanf("%d%d",&n,&m) == 2 )
{
for( int i = 0; i <= n; i ++ )
map[i].clear();
for( int i = 1; i <= m; i ++ )
{
scanf("%d%d%d",&a,&b,&c);
map[a].push_back( node(b,c) );
map[b].push_back( node(a,c) );
}
scanf("%d%d",&a,&b);
if( SPEA( a ) )
{
if( dis[b] != inf )
printf( "%d\n",dis[b] );
else
puts("-1");
}
else
{
puts("0");
}
}
return 0;
}
#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 = 205;
const int inf = 1<<30;
typedef __int64 LL;
int n,m,pos;
struct node
{
int to,w,next;
}edge[maxn*5];
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 )
{
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 );
}
scanf("%d%d",&u,&v);
SPEA(u);
if( dis[v] != inf )
printf("%d\n",dis[v]);
else
puts("-1");
}
return 0;
}