邻接表(图论，模板)

#include<bits/stdc++.h>
using namespace std;
const int N = 2510, M = 6200 * 2 + 10;
int h[N], e[M], w[M], ne[M], idx;
void add(int a, int b, int c)//添加边的操作
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
//e存终点，w存权值，ne存相同出发点(a)的上一条边的号码，h存号码
    
int main() {
    memset(h, -1, sizeof h);//记得初始化
    int a, b, c;
    cin >> a >> b >> c;
    add(a, b, c), add(b, a, c);//添加双向边
    for (int i = h[a]; ~i; i = ne[i]);//遍历方法
}
邻接表2.0
vector<int> E[maxn];
E[s].push_back(t);
for(int i = 0; i < (int)E[u].size(); i++);