每次确定dist中最小的dist[u]
然后对u的邻接点进行处理:
1.dist[u]<=edges[u][j])&&(s[j]==0)&&(edges[u][j]<dist[j]
2.dist[u]>edges[u][j])&&(s[j]==0)&&(dist[u]<dist[j]
#include <stdio.h>
#include <iostream>#include <string>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <queue>
using namespace std;
#define INF 100000000
float edges[205][205];
float dist[205];
int s[205];
int n;
void dijstra()
{
int i,j;
int min,u;
for(i=0;i<n;i++)
{
dist[i]=edges[0][i];
}
dist[0]=0;
s[0]=1;
for(i=1;i<n;i++)
{
min=INF;
for(j=0;j<n;j++)
{
if(min>dist[j]&&(s[j]==0))
{
min=dist[j];
u=j;
}
}
s[u]=1;
for(j=0;j<n;j++)
{
if((dist[u]<=edges[u][j])&&(s[j]==0)&&(edges[u][j]<dist[j]))
{
dist[j]=edges[u][j];
}
else if((dist[u]>edges[u][j])&&(s[j]==0)&&(dist[u]<dist[j]))
{
dist[j]=dist[u];
}
}
}
}
int main()
{
int i,j,k,m;
int num;
double len,sum1;
num=0;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
{
return 0;
}
int px[205];
int py[205];
for(i=0;i<n;i++)
{
scanf("%d%d",&px[i],&py[i]);
}
for(i=0;i<n;i++)
{
edges[i][i]=0;
for(j=i+1;j<n;j++)
{
sum1=(px[i]-px[j])*(px[i]-px[j])+(py[i]-py[j])*(py[i]-py[j]);
len=sqrt(sum1);
edges[i][j]=len;
edges[j][i]=len;
}
s[i]=0;
dist[i]=INF;
}
dijstra();
num++;
printf("Scenario #%d\n",num);
printf("Frog Distance = %.3f\n",dist[1]);
printf("\n");
}
return 0;
}