开始整理我的板子咯——持续更新中——

struct E
{
    int to, w, next;
}edge[N];

//我这里习惯用1作为第一条边
int tot=1, head[N];

inline void add_edge(int u, int v, int w)
{
    edge[tot].to = v;
    edge[tot].w = w;
    edge[tot].next = head[u];
    head[u] = tot++;
}

//遍历代码
for (int i = head[u]; !i; i=edge[i].next)
{
    int v=edge[i].to;
    int w=edge[i].w;
    //to do something
}