邻接表

const int MAX[200001]; 
struct node{
	int from,to,w;
	node(int f,int t,int d){ from = f; to = t; w = d;}
};
vector<node> edge[MAX];

//初始化
for(int i=0;i<MAX;i++)
	edge[i].clear();

//存边
edge[u].push_back(node(u,v,w));

//遍历结点u连接的所有边
for(int i=0;i<edge[u].size();i++){
	edge[u][i].to //即为与u连接的结点 
}