DIJKSTRA 临接表

 #include <iostream>
 #include <algorithm>
 #include <cmath>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 using namespace std;
 int value[],to[],next[];
 int head[],total;
 int book[];
 int dis[];
 int n,m;
 void adl(int a,int b,int c)
 {
     total++;
     to[total]=b;
     value[total]=c;
     next[total]=head[a];
     head[a]=total;
 }
 void dijkstra(int u)
 {
     memset(dis,,sizeof(dis));
     memset(book,,sizeof(book));
     dis[u]=;
     for(int i=;i<=n;i++)
     {
         int start=-;
         for(int j=;j<=n;j++)
             if(book[j]== && (dis[start]>dis[j] || start==-))
                 start=j;
         book[start]=;
         for(int e=head[start];e;e=next[e])
             dis[to[e]]=min(dis[to[e]],dis[start]+value[e]);
     }
 }
 int main()
 {
     cin>>n>>m;
     for(int i=;i<=m;i++)
     {
         int a,b,c;
         cin>>a>>b>>c;
         adl(a,b,c);
      }
      dijkstra();
      for(int i=;i<=n;i++)
          cout<<dis[i]<<" ";
 }