最短路的Floyd-Dijkstra-Spfa板子

int maps[105][105];  
int n,m;  
//³õʼ»¯  
void init()  
{  
    for(int i=1;i<=n;++i)  
    {  
        for(int j=1;j<=n;++j)  
        {  
            if(i==j)  
                maps[i][j]=0;  
            else  
                maps[i][j]=INF;  
        }  
    }  
}  
  
void floyd()  
{  
    for(int k=1;k<=n;++k)  
    {  
        for(int i=1;i<=n;++i)  
        {  
            for(int j=1;j<=n;++j)  
                maps[i][j]=min(maps[i][j],maps[i][k]+maps[k][j]);  
        }  
    }  
}  
  
int spfa(int st,int ed)