图的邻接表的建立和深度优先遍历，递归与非递归 C语言实现

图的邻接表的建立和深度优先遍历，递归与非递归

下边代码块是邻接表的建立

typedef enum{
   DG,UDG}GraphKind;

typedef struct ArcNode
{
   
	int adjvex; //结点的数值
	struct ArcNode *next;  //指向邻接结点的指针
}ArcNode; 

typedef struct VertexNode
{
   
	char vexdata; //结点的值
	ArcNode *head;//头指针
}VertexNode;

typedef struct
{
   
	VertexNode vertex[MAX_VER_NUM];//存放所有结点的数组
	int vexnum,arcnum;//结点数，边数
	GraphKind Type;//图类型
}LGraph;

int index(char vex,LGraph *lg)//索引vex结点对应的位置值
{
   
	int i;
	for(i=1;i<=lg->vexnum;i++)
	{
   
		if(lg->vertex[i].vexdata == vex） 
		{
   
			return i;
		}
	}
	return 0;
}

void Creat_LG(LGraph *lg)
{
   
	int i,j,v1_index,v2_index,type;
	char v1,v2;
	ArcNode *p1,*p2;
	printf("please input graph type 0.DG 1.UDG. input nums:");
	scanf("%d",&type);//输入图的类型
	if(type == 0)
	{
   
		lg->Type = DG;
	}
	else if(type == 1)
	{
   
		lg->Type = UDG;
	}
	else
	{
   
		printf("please input 0 or 1!!!");
		return;
	}
	printf("Please input vexnum:");
	scanf("%d",&lg->vexnum);//输入结点数
	printf("Please input arcnum:");
	scanf("%d",&lg->arcnum);//输入边数
	getchar();
	for (i=1;i<=lg->vexnum;i++)
	{
   
		lg->vertex[i].head = NULL;
		printf("Please input %d vex:",i);
		scanf("%c",&lg->vertex[i].vexdata);	//遍历存放所有结点
		getchar();
	}
	for (j=1;j<=lg->arcnum;j++)
	{
   
		printf("Please input %d arc(vex1 vex2):",j);
		scanf("%c %c",&v1,&v2);
		getchar();
		v1_index = index(v1,lg);//索引结点对应的位置值
		v2_index = index(v2,lg);
		if (lg->Type == 1)
		{
   
			p1 = (ArcNode *