邻接表实现最短路

#include<iostream>#include<cstring>#include<algorithm>using namespace std;#define maxnum 100100int h[maxnum];int val[maxnum];int to[maxnum];int nx[maxnum];int sz;int n, m;void add(int x, int y, int v){    to[sz] = y;    val[sz] = v;    nx[sz] = h[x];    h[x] = sz;    sz++;}int main(){    while (cin >> n >> m)    {        int x, y, v;        memset(h, -1, sizeof(h));        sz = 0;        for (int i = 1;i <= n;i++)        {            cin >> x >> y >> v;            add(x, y, v);        }        for (int i = h[x];i != -1;i = nx[i])        {            to[i];            val[i];        }    }    return 0;}