最短路（闲写的，给自己看的，用来打路径的，最长的路段，最短路段）

1.邻接矩阵

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAX 5000
#define inf 0x3f3f3f3f

int n,t,i,j;
int map[MAX][MAX],xia[MAX],d[MAX],cun[MAX],cun1[MAX];

int main()
{
    while(~scanf("%d%d",&t,&n))
    {
        memset(xia,0,sizeof(xia));
        memset(cun,0,sizeof(cun));
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(i==j) map[i][j]=0;
                else map[i][j]=inf;
        for(i=1; i<=t; i++)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=map[b][a]=min(map[a][b],c);
        }
        for(i=1; i<=n; i++)
            d[i]=map[1][i];
        cun[1]=1;
        int x,hmax,shu=1;
        for(i=1; i<=n; i++)
        {
            hmax=inf;
            for(j=1; j<=n; j++)
            {
                if(xia[j]==0&&d[j]<hmax)
                    hmax=d[x=j];
            }
            xia[x]=1;
            for(j=1; j<=n; j++)
                if(d[j]>d[x]+map[x][j])
                {
                    d[j]=d[x]+map[x][j];
                    cun[j]=x;
                    shu++;
                }
        }
        int h=n,maxx=0,maxxx=0,minn=inf;
        for(i=1; i<=shu; i++)
            printf("%d ",h),cun1[maxx++]=h,h=cun[h];
        printf("1\n");
        cun1[maxx]=1;
        for(i=1;i<=maxx;i++)
            {
                maxxx=max(maxxx,map[cun1[i]][cun1[i-1]]);
            minn=min(minn,map[cun1[i]][cun1[i-1]]);
            }
        printf("%d %d\n",maxxx,minn);
        //printf("%d\n",d[n]);
    }
    return 0;
}

2.邻接表（没有打出最值路段，需要写成map，路径打出来了)

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAX 5000
#define inf 0x3f3f3f3f

int u[MAX],v[MAX],w[MAX],d[MAX],first[MAX],next[MAX],cun[MAX];
bool xia[MAX];
int i,j,n,t;

int main()
{
    while(~scanf("%d%d",&t,&n))
    {
        memset(first,-1,sizeof(first));
        memset(next,-1,sizeof(next));
        memset(xia,false,sizeof(xia));
        xia[1]=true;
        for(i=1;i<=2*t;i+=2)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            u[i]=v[i+1]=a,u[i+1]=v[i]=b,w[i]=w[i+1]=c;
            next[i]=first[u[i]],next[i+1]=first[u[i+1]];
            first[u[i]]=i,first[u[i+1]]=i+1;
        }
        for(i=1;i<=n;i++)
            d[i]=inf;
        d[1]=0;
        int hmax,x=1,sum=1;
        for(i=2;i<=n;i++)
        {
            for(j=first[x];j!=-1;j=next[j])
            {
                if(xia[v[j]]==false&&d[v[j]]>d[x]+w[j])
                    {
                       d[v[j]]=d[x]+w[j];
                       cun[v[j]]=x;
                       sum++;
                    }
            }
            hmax=inf;
            for(j=1;j<=n;j++)
            {
                if(xia[j]==0&&d[j]<hmax)
                    hmax=d[x=j];
            }
            xia[x]=1;
        }
        printf("%d\n",d[n]);
        int y=n,maxx=0;
        for(i=2;i<=sum-1;i++)
                printf("%d ",y),y=cun[y];

    }
    return 0;
}

3.bellman-ford（也是要用map 才能求最值路段）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAX 5000
#define inf 0x3f3f3f3f

int i,j,n,t;
int u[MAX],v[MAX],w[MAX],d[MAX],cun[MAX];

int main()
{
    while(~scanf("%d%d",&t,&n))
    {
        for(i=1; i<=n; i++)
            d[i]=inf;
        d[1]=0;
        for(i=1; i<=t; i++)
            scanf("%d%d%d",&u[i],&v[i],&w[i]);
        for(i=1; i<n; i++)
            for(j=1; j<=t; j++)
            {
                if(d[u[j]]>d[v[j]]+w[j])
                {
                    d[u[j]]=d[v[j]]+w[j];
                    cun[u[j]]=v[j];
                }
                if(d[v[j]]>d[u[j]]+w[j])
                {
                    d[v[j]]=d[u[j]]+w[j];
                    cun[v[j]]=u[j];
                }

            }
        printf("%d\n",d[n]);
        int f=n;
        for(i=1;f!=0;i++)
        {
            printf("%d ",f);
            f=cun[f];
        }
        printf("\n");
    }
    return 0;
}

4.spfa