有向图中点的出度即为邻接表中每个点后面的节点个数
#include<iostream>
using namespace std;
typedef struct B
{
int data;
struct B *next;
}biao;
void insert(biao b[],int i,int j)
{
biao *p=&b[i];
while(p->next !=NULL)
{
p=p->next ;
}
biao *q=new biao;
q->data =j;
q->next =NULL;
p->next =q;
}
int main()
{
int n;
cin>>n;
biao b[n];
for(int i=0;i<n;i++)
b[i].next =NULL;
int m,x,y;
cin>>m;
while(m--)
{
cin>>x>>y;
insert(b,x,y);
}
int num[n]={0};
for(int i=0;i<n;i++)
{
biao *p=&b[i];
p=p->next ;
while(p!=NULL)
{
num[i]++;
p=p->next ;
}
cout<<num[i]<<endl;
}
return 0;
}