邻接表

#include <stdio.h>
#include <stdlib.h>
#include <cstring>


const int MAXN = 102;
struct ArcNode
{
int adjvex;
ArcNode *next;
};
struct VNode 
{
ArcNode* head1;
ArcNode* head2;
int data;

};


struct LGraph
{
int vexnum;
int arcnum;
VNode  vertexs[MAXN];
};


LGraph lg;


void CreatLG() 
{

for(int i=0;i<lg.arcnum;i++)
lg.vertexs[i].head1=lg.vertexs[i].head2=NULL;
for(int i=0;i<lg.arcnum;i++)
{
int a,b;
scanf("%d%d",&a,&b);
a--;
b--;


ArcNode* arc = new ArcNode;
arc->adjvex=b;
arc->next=lg.vertexs[a].head1;
lg.vertexs[a].head1=arc;


ArcNode* arc2= new ArcNode;
arc2->adjvex = a;
arc2->next= lg.vertexs[b].head2;
lg.vertexs[b].head2 =arc2;


}
}


void DeleteLG()
{
for(int i=0;i<lg.vexnum;i++)
{
ArcNode* p =lg.vertexs[i].head1;
while(p)
{
lg.vertexs[i].head1=p->next;
delete p;
p= lg.vertexs[i].head1;
}


p=lg.vertexs[i].head2;
while(p)
{
lg.vertexs[i].head2=p->next;
delete p;
p=lg.vertexs[i].head2;
}
}
}
int main()
{
freopen("1_3.txt","r",stdin);
   while(scanf("%d%d",&lg.vexnum,&lg.arcnum)&&!(lg.vexnum==0&&lg.arcnum==0))
   {
  CreatLG();
  
  for(int i=0;i<lg.vexnum;i++)
  {
  int sum1=0;
  ArcNode * p=lg.vertexs[i].head1;
  while(p)
  {
  sum1++;
  p=p->next;
  }
  if(i!=lg.vexnum-1)
  printf("%d ",sum1);
  else
  printf("%d",sum1);
  }
      printf("\n");
  for(int i=0;i<lg.vexnum;i++)
  {
  int sum1=0;
  ArcNode * p=lg.vertexs[i].head2;
  while(p)
  {
  sum1++;
  p=p->next;
  }
  if(i!=lg.vexnum-1)
  printf("%d ",sum1);
  else
  printf("%d",sum1);
  }


printf("\n");


   }


DeleteLG();
   while(1);
}