×î¶Ì· Flyod

×î¶Ì· Flyod

ʱ¼ä¸´ÔÓ¶È £º n^3(nΪµãµÄ¸öÊý)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<deque>
#include<iostream>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=200;

int graph[N][N];
int dis[N];
int n,m;

void flyod()
{
    int i,p,j,k;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                if(graph[i][j]>graph[i][k]+graph[k][j])
                    graph[i][j]=graph[i][k]+graph[k][j];
            }
}

int main()
{
    int a,b,c;
    int i,p,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0)
            break;
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                if(i==j)
                    graph[i][j]=0;
                else
                    graph[i][j]=INF;
            }

        for(i=1; i<=m; i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            graph[a][b]=graph[b][a]=c;
        }
        flyod();
        printf("%d\n",graph[1][n]);
    }
    return 0;
}