空间数据结构——图（C语言）

知识点总结：

待编辑...

上机作业：

DS init code by 废阿柴 2024/5/13

1.读入文件中的邻接矩阵，将它转化为关联矩阵（邻接表），将结果存入新的文件中，并且重新转换回邻接矩阵

（以无向图为例）

练习材料——AdjMatrix.txt

（1）邻接矩阵与关联矩阵的互相转换

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<memory.h>
const char* infilename = "D:\\c practice data\\graph\\AdjMatrix.txt";
const char* outfilename = "D:\\c practice data\\graph\\LinkMatrix.txt";
//1.从文本文件中读取邻接矩阵
int* readAdjMatrix(const char* infilename, int* PointsCount,int*LinesCount);

//2.将邻接矩阵转化成关联矩阵
int* convertLinkMatrix(int* adjMatrix, int PointsCount,int LinesCount);

//3.将关联矩阵存储在新的文本文件中
bool saveLinkMatrix(const char *outfilename,int* LinkMatrix,int PointsCount,int LinesCount);

//4.将关联矩阵转换回邻接矩阵
int* convertAdjMatrix(int* linkMatrix, int PointsCount,int LinesCount);

//打印矩阵
void printMatrix(int* matrix, int Ccount, int Rcount);

int main() {
	int PointsCount = 0;
	int LinesCount = 0;
	int* adjMatrix = readAdjMatrix(infilename, &PointsCount,&LinesCount);
	printf("打印邻接矩阵...\n");
	printMatrix(adjMatrix, PointsCount, PointsCount);
	//转换
	int* linkMatrix=convertLinkMatrix(adjMatrix, PointsCount, LinesCount);
	printf("打印关联矩阵...\n");
	printMatrix(linkMatrix, LinesCount, PointsCount);
	bool result = saveLinkMatrix(outfilename, linkMatrix, PointsCount, LinesCount);
	if (result)
		printf("保存成功！\n");
	//复原
	int* adjMatrix2 = convertAdjMatrix(linkMatrix, PointsCount, LinesCount);
	printf("打印复原的邻接矩阵...\n");
	printMatrix(adjMatrix2, PointsCount, PointsCount);
	free(adjMatrix);
	free(linkMatrix);
	free(adjMatrix2);
	return 0;
}
//1.从文本文件中读取邻接矩阵
int* readAdjMatrix(const char* infilename, int* PointsCount,int*LinesCount) 
{
	FILE* fp = fopen(infilename, "r");
	if (fp == nullptr) {
		printf("open error!\n");
		return NULL;
	}
	fscanf(fp, "%d", PointsCount);
	int* matrix = (int*)malloc(sizeof(int) * (*PointsCount) * (*PointsCount));
	memset(matrix, 0, sizeof(int) * (*PointsCount) * (*PointsCount));
	int val = 0;
	int line = 0;
	for (int i = 0; i < (*PointsCount); i++) {
		for (int j = 0; j < (*PointsCount); j++) {
			fscanf(fp, "%d", &val);
			matrix[i * (*PointsCount)+j] = val;
			if (val !=0) {
				line += 1;
			}
		}
	}
	*LinesCount = line / 2;
	fclose(fp);
	return matrix;
}

//2.将邻接矩阵转化成关联矩阵(需要注意，这些矩阵仅用于还原数据结构，不需要还原到线序号对应)
int* convertLinkMatrix(int* adjMatrix, int PointsCount, int LinesCount)
{
	//关联矩阵初始化
	int* linkMatrix = (int*)malloc(sizeof(int) * PointsCount * LinesCount);
	memset(linkMatrix, 0, sizeof(int) * PointsCount * LinesCount);
	int LineIndex = 0;
	for (int i = 0; i < PointsCount; i++) {
		for (int j = 0; j < PointsCount; j++) {
			if (adjMatrix[i * PointsCount + j] == 1&&j>i)//注意只有上右半角
			{
				linkMatrix[i * LinesCount + LineIndex] = 1;
				linkMatrix[j * LinesCount + LineIndex] = 1;
				//相当于邻接矩阵[i][j]==1->关联矩阵的[i][index]和[j][index]均为1；
				LineIndex += 1;
			}
		}
	}
	return linkMatrix;
}

//3.将关联矩阵存储在新的文本文件中
bool saveLinkMatrix(const char* outfilename, int* LinkMatrix, int PointsCount, int LinesCount)
{
	FILE* fp = fopen(outfilename, "w");
	if (fp == nullptr) {
		printf("save error!\n");
		return false;
	}
	fprintf(fp, "%d %d\n", PointsCount, LinesCount);
	for (int i = 0; i < PointsCount; i++) {
		for (int j = 0; j < LinesCount; j++) {
			fprintf(fp, "%d ", LinkMatrix[i * LinesCount + j]);
		}
		fprintf(fp, "\n");
	}
	fclose(fp);
	return true;
}

//4.将关联矩阵转换回邻接矩阵
int* convertAdjMatrix(int* linkMatrix, int PointsCount,int LinesCount)
{
	int* adjmatrix2 = (int*)malloc(sizeof(int) * PointsCount * PointsCount);
	memset(adjmatrix2, 0, sizeof(int) * PointsCount * PointsCount);
	//对LinkMatrix的搜寻放在列优先中
	for (int j = 0; j < LinesCount; j++) {
		int count = 0;//count需要达到2
		int points[2] = { 0 };
		for (int i = 0; i < PointsCount; i++) {
			if (linkMatrix[i * LinesCount + j] == 1) //注意索引逻辑是不变的
			{
				points[count] = i;
				count += 1;
			}
			if (count == 2) {
				adjmatrix2[points[0] * PointsCount + points[1]] = 1;
				adjmatrix2[points[1] * PointsCount + points[0]]=1;
				break;
			}
		}
	}
	return adjmatrix2;
}

//打印矩阵
void printMatrix(int* matrix, int Ccount, int Rcount) 
{
	for (int i = 0; i < Rcount; i++) {
		for (int j = 0; j < Ccount; j++) {
			printf("%d ", matrix[Ccount * i + j]);
		}
		printf("\n");
	}
	return;
}

（2）邻接矩阵-邻接表的相互转换

（3）邻接表-关联矩阵的相互转换

这里我们用有向图！！！

练习材料 AdjMatrix.txt文本 

 

（修正了三种存储方式的结构，参考了熊猫老师的文章http://t.csdnimg.cn/wrqeX）

/*
*DS  将读入的邻接表转化为邻接矩阵，保存，最后转换回邻接矩阵
* 以有向图为例
*second code by 废阿柴 2024/5/15
*/

#define _CRT_SECURE_NO_WARNINGS