#include<stdio.h>
#include<stdlib.h>
#define MAX 20
struct node
{
int data;
struct graph *next;
};
struct Graph
{
struct node array[MAX];
int vexnum,arcnum;
};
void Create_Graph(struct Graph *G)
{
int i,j;
int Visited[MAX];
struct node *p;
for(i=0;i<G->vexnum;i++)
scanf("%d%d",&G->vexnum,&G->arcnum);
for(j=0;j<G->vexnum;j++)
Visited[j] = 0;
for(i=0;i<G->vexnum;i++)
{
Visited[i] = 1;
p = G->array[i].next;
while(p)
{
if(!Visited[i])
{
printf("%d",G->array[i].data);
p = p->next;
}
else
break;
}
}
}
图的邻接表
最新推荐文章于 2018-12-23 16:23:30 发布