ljbbst.cpp

输入一个图的顶点

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

#define MaxVertexNum 12
#define MaxEdgeNum 20
typedef int VertexType;
typedef VertexType verlist[MaxVertexNum];
int visited[MaxVertexNum]={0};

struct edgenode
{
  int adjvex;
  int weight;
  struct edgenode* next;
};

typedef struct edgenode* adjlist[MaxVertexNum];

void Create(verlist GV,adjlist GL,int n,int e)
{
  int i,j,k;
  printf("输入%d个顶点数据：\n",n);
  for(i=0;i<n;i++) scanf("%d",&GV[i]);
  for(i=0;i<n;i++) GL=NULL;
  printf("输入%d条无向无权边：\n",e);
  for(k=1;k<=e;k++)
  {
    struct edgenode* p;
    scanf("%d,%d",&i,&j);
    p=(struct edgenode* )malloc(sizeof(struct edgenode));
    p->adjvex=j;
    p->next=GL[i];
    GL[i]=p;
    p=(struct edgenode* )malloc(sizeof(struct edgenode));
    p->adjvex=i;
    p->next=GL[j];
    GL[j]=p;
  }
}



main()
{
  int n,i,e,k;
  verlist GV;
  adjlist GL;
  printf("请输入顶点数：\n");
  scanf("%d",&n);
  printf("请输入边数：\n");
  scanf("%d",&e);
  Create(GV,GL,n,e);
  for(i=0;i<n;i++)
  printf("%d\n",GV[i]);
  getchar();
}