裸的Floyd算法
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<sstream>
#define LL long long
#define OJ_PRINT 0
#define READ_FILE 0
using namespace std;
const int NN_MAX = 110;
const int MM_MAX = 600;
const int INF = 0x0fffffff;
struct Edge{
int from,to,open,close,spend;
Edge (int a1=0,int b1=0,int c1=0,int d1=0,int e1=0):from(a1),to(b1),open(c1),close(d1),spend(e1){}
}theEdge[MM_MAX];
/**********************************************************/
int maps[NN_MAX][NN_MAX];
set<int> sets;
int num,sum;
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
void floyd ();
void init ();
/**********************************************************/
int main()
{
if (READ_FILE) freopen ("in.txt","r",stdin);
int a,b,tt=1;
while (1)
{
init ();
scanf ("%d%d",&a,&b);
if (a==0&&b==0) break;
sets.insert (a);sets.insert (b);
maps[a][b]=1;
while (scanf ("%d%d",&a,&b)&& (a||b))
{
maps[a][b]=1;
sets.insert (a); sets.insert (b);
}
num=sets.size ();
num=num*(num-1);
floyd ();
for (int i=1;i<NN_MAX;i++)
for (int j=1;j<NN_MAX;j++)
if (maps[i][j]!=INF)
sum+=maps[i][j];
printf ("Case %d: average length between pages = %.3lf clicks\n",tt++,double (sum)/double (num));
}
return 0;
}
void init ()
{
for (int i=0;i<NN_MAX;i++)
for (int j=0;j<NN_MAX;j++)
maps[i][j]=(i==j?0:INF);
sets.clear ();
num=0;sum=0;
}
void floyd ()
{
for (int k=1;k<NN_MAX;k++)
for (int i=1;i<NN_MAX;i++)
for (int j=1;j<NN_MAX;j++)
maps[i][j]=min_2 (maps[i][j],maps[i][k]+maps[k][j]);
}