#include <vector>#include <cstdio>usingnamespacestd;
constint MAXN = 100000;
vector<int> edge[MAXN];
int main()
{
int n, m; //n顶点,m边for(int i = 0; i < m; ++i)
{
int a, b;
scanf("%d%d", &a, &b);
edge[a].push_back(b);
//edge[b].push_back(a); //如果是无向图要执行这句,来回都要存!
}
return0;
}
1.邻接矩阵int E[110][110];E[1][2]=1;E[5][3]=0;2.邻接链表#include <vector>#include <cstdio>using namespace std;const int MAXN = 100000;vector<int> edge[MAXN];int main(){ int n, m; //n顶点,m边 for(int i