存边有点类似链表的头插法。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<math.h>
#include<map>
using namespace std;
const int N = 1e5;
struct edge
{
int x;
int y;
int w;
int next;
}eg[N];
int head[N],cnt;
void addeg(int a, int b, int w)//单向
{
cnt++;
eg[cnt] = { a,b,w,head[a]};
head[a] = cnt;
}
void addeg2(int a, int b, int w)//双向
{
cnt++;
eg[cnt] = { a,b,w,head[a]};
head[a] = cnt;
cnt++;
eg[cnt] = { b,a,w,head[b]};
head[b] = cnt;
}
//遍历以a为起点的所有边
void traeg(int a)
{
for (int i = head[a]; i; i = eg[i].next)
{
operate();
}
}
int main()
{
return 0;
}