hdu-2544-最短路(Floyd算法模板)

题目链接

题意很清晰，入门级题目，适合各种模板，可用dijkstra, floyd, Bellman-ford, spfa

Dijkstra链接

Floyd链接

Bellman-Ford链接

SPFA链接

 /*
     Name:HDU-2544-最短路
     Copyright:
     Author:
     Date: 2018/4/17 10:34:47
     Description:
 */
 #include <cstring>
 #include <cstdio>
 #include <iostream>
 using namespace std;
 const int MAXN = ;
 const int INF = 0x3f3f3f3f;
 int N, g[MAXN][MAXN], M;
 void floyd () {
     for (int k=; k<=N; ++k)  {
         for (int i=; i<=N; i++) {
             for (int j=; j<=N; j++) {
                 g[i][j] = min(g[i][j], (g[i][k]+g[k][j]));
             }
         }
     }
 }
 int main()
 {
 //    freopen("in.txt", "r", stdin);
     while (~scanf("%d %d", &N, &M) && (N+M)) {
         memset(g, 0x3f, sizeof(g));
         for (int i=; i<M; i++) {
             int a, b, c;
             scanf("%d %d %d", &a, &b, &c);
             if (g[a][b] > c) {
                 g[a][b] = g[b][a] = c;
             }
         }
         floyd();
         cout<<g[][N]<<endl;
     }
     return ;
 }