spfa ,Dijkstral,bellmanFord求最短路径

求起点到终点的最短路径。

Dijkstral：

#include <iostream>
#include <string.h>
using namespace std;
const int INF=100000000;
int map[110][110];
int n,m;
int dis[110],vis[110];
int Dijkstra(int s,int t)
{
    for(int i=1;i<=n;i++)
        dis[i]=INF;
    memset(vis,0,sizeof(vis));
    dis[s]=0;
    for(int i=0;i<n;i++)
    {
        int ans=INF,u;
        for(int j=1;j<=n;j++)
            if(!vis[j] && dis[j]<ans)
            {
                ans=dis[j];
                u=j;
            }
        vis[u]=1;
        if(u==t) return ans;
        for(int j=1;j<=n;j++)
            if(map[u][j]!=INF && dis[u]+map[u][j]<dis[j])
                dis[j]=dis[u]+map[u][j];
    }
}
int main()
{
    while(scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0) break;
        int s,t,k;
        for(int i=0;i<=n;i++)
            for(int j=0;j<=n;j++)
                map[i][j]=INF;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&s,&t,&k);
            map[s][t]=map[t][s]=k;
        }
        printf("%d\n",Dijkstra(1,n));
    }
    return 0;
}  

 

SPFA：

#include<iostream>
#include<queue>
using namespace std;
int n,m;
int map[105][105],d[105],visit[105];
queue<int>q;
void spfa()
{
    int i,p;
    while(!q.empty()) q.pop();
    q.push(1);
    d[1]=0;
    visit[1]=1; 
    while(!q.empty())
    {
        p=q.front();
        q.pop();
        visit[p]=0;
        for(i=1;i<=n;i++)
        {
           if(map[p][i])
           {
             if(d[p]+map[p][i]<d[i])
             {  
              if(!visit[i])
              {
                visit[i]=1;
                q.push(i);
              }
               d[i]=d[p]+map[p][i]; 
              }
           }
        }
    }
}
int main()
{
      int i,j,a,b,c;
       while(scanf("%d%d",&n,&m))
       {
         if(n==0&&m==0) break;
        memset(map,0,sizeof(map));
        for(i=0;i<m;i++)
        {
          scanf("%d%d%d",&a,&b,&c);
          map[a][b]=c;
          map[b][a]=c;
        }
        memset(visit,0,sizeof(visit));
        for(j=1;j<=n;j++) d[j]=10000000;
        spfa();
        printf("%d\n",d[n]);  
    } 
    return 0;  
}  

      
      
      
    

无向图的bellman_ford

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
 
const int NV = 101;
 
struct Edge {
    int u, v, w;
}gra[NV * NV];
 
int dis[NV];
 
void BellmanFord(int n, int m) {
    memset(dis, 0x7f, sizeof(dis));
    dis[1] = 0;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (dis[gra[j].u] + gra[j].w < dis[gra[j].v]) {
                dis[gra[j].v] = dis[gra[j].u] + gra[j].w;
            }
            if (dis[gra[j].v] + gra[j].w < dis[gra[j].u]) {
                dis[gra[j].u] = dis[gra[j].v] + gra[j].w;
            }
        }
    }
}
 
int main() {
    int n, m;
    while (~scanf("%d %d", &n, &m), n | m) {
        for (int i = 0; i < m; i++) {
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            gra[i].u = u, gra[i].v = v, gra[i].w = w;
        }
        BellmanFord(n, m);
        printf("%d\n", dis[n]);
    }
    return 0;
}