数据结构——十字链表法（C语言实现）

数据结构——十字链表法（C语言实现）

• 直接上代码

//十字链表 十字链表只能存储有向图 
#include "stdio.h"
#include "stdlib.h"
#define max 100
//弧结点
typedef struct ArcBox {
	int  headvex, tailvex; //起点和终点在顺序表中的索引
	struct ArcBox *hlink, *tlink; //起点或终点相同的弧
//	int info; 						//权 
}ArcBox;
//顶点结点 
typedef struct VexNode {
	ArcBox *firstin, *firstout; //出边和入边链表
	int data;			//数据 
}VexNode;
//图 
typedef struct {
	VexNode xlist[max];			
	int vexnum, arcnum;			//顶点个数和边的个数 
}OLGraph;
//定义邻接矩阵 
typedef struct {
	int existbool;
	ArcBox *node;
}Arr;
int main()
{
	OLGraph graph;
	printf("请输入图的顶点个数与边的个数：\n");
	scanf("%d %d",&graph.vexnum,&graph.arcnum);
	int i,j,k,flag;
	printf("请输入顶点数据：\n"); 
	//初始化顶点 
	for (i = 0;i < graph.vexnum;i++)
	{
		scanf("%d", &graph.xlist[i].data);
		graph.xlist[i].firstin = NULL;
		graph.xlist[i].firstout = NULL;
	}
	Arr a[max][max];
	//利用邻接矩阵初始化十字链表 
	printf("请输入十字链表的邻接矩阵：\n");
	//分配内存 
	//初始化矩阵 
	for (i = 0;i < graph.vexnum;i++)
	{
		for (j = 0;j < graph.vexnum;j++)
		{
			scanf("%d", &a[i][j].existbool);
			if (a[i][j].existbool == 0)
				continue;
			a[i][j].node = (ArcBox*)malloc(sizeof(ArcBox));
			a[i][j].node->headvex = j;
			a[i][j].node->tailvex = i;
			a[i][j].node->hlink = NULL;
			a[i][j].node->tlink = NULL;
		}
	}
	for (i = 0;i < graph.vexnum;i++)
	{
		flag = 0;
		for (j = 0;j < graph.vexnum;j++)
		{
			if (a[i][j].existbool == 0)
				continue;
			for (k = j + 1;k < graph.vexnum;k++)
			{
				if (a[i][k].existbool == 1)
					break;
			}
			if (k >= graph.vexnum)
				a[i][j].node->tlink = NULL;
			else
				a[i][j].node->tlink = a[i][k].node;
			if (flag == 0)
				graph.xlist[i].firstout = a[i][j].node;
			flag = 1;
		}
	}
	for (i = 0;i < graph.vexnum;i++)
	{
		flag = 0;
		for (j = 0;j < graph.vexnum;j++)
		{
			if (a[j][i].existbool == 0)
				continue;
			for (k = j + 1;k < graph.vexnum;k++)
			{
				if (a[k][i].existbool == 1)
					break;
			}
			if (k >= graph.vexnum)
				a[j][i].node->hlink = NULL;
			else
				a[j][i].node->hlink = a[k][i].node;
			if (flag == 0)
				graph.xlist[i].firstin = a[j][i].node;
			flag = 1;
		}
	}
	printf("十字链表初始化完成！\n");
	printf("图中有%d个结点,%d条边\n",graph.vexnum,graph.arcnum);
	int count;
	ArcBox* s;
	for (i = 0;i < graph.vexnum;i++)
	{
		printf("关于第[%d]个结点[%d]，指出的边信息如下：\n",i+1,graph.xlist[i].data); 
		count = 0;
		s = graph.xlist[i].firstout;
		while (s != NULL)
		{
			count++;
			printf("第%d条：指向第[%d]个结点[%d]\n", count, s->headvex + 1, graph.xlist[s->headvex].data);
			s = s->tlink;
		}
		count = 0;
		printf("指入的边信息如下：\n");
		s = graph.xlist[i].firstin;
		while(s != NULL)
		{
			count++;
			printf("第%d条：被第[%d]个结点[%d]指入\n",count,s->tailvex+1,graph.xlist[s->tailvex].data);
			s = s->hlink;
		}
	}
	return 0;
}

中间多次循环代码冗杂，可优化，初学轻喷。