压缩矩阵的转置

最新推荐文章于 2022-05-23 16:36:42 发布

程序木.

最新推荐文章于 2022-05-23 16:36:42 发布

阅读量100

点赞数

文章标签：压缩矩阵转置内存管理数据结构算法

本文链接：https://blog.csdn.net/qq_36560939/article/details/124870625

版权

压缩矩阵的转置

定义行列

typedef struct Triple {
	int i;//行
	int j;  //列
	elem e; //值
} Triple, *TriplePtr;

//压缩矩阵

CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int **paraData) {
	int i;
	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
	resultPtr->rows = paraRows; //行
	resultPtr->columns = paraColumns;  //列

	resultPtr->numElements = paraElements;
	resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));

	//压缩
	for (i = 0; i < paraElements; i ++) {

		resultPtr->elements[i].i = paraData[i][0];
		resultPtr->elements[i].j = paraData[i][1];
		resultPtr->elements[i].e = paraData[i][2];
	}

	return resultPtr;
}

/循环打印压缩

void printCompressedMatrix(CompressedMatrixPtr paraPtr) {
	int i;

	for (i = 0; i < paraPtr->numElements; i ++) {

		printf("(%d, %d): %d\r\n", paraPtr->elements[i].i, paraPtr->elements[i].j, paraPtr->elements[i].e);
	}
}

压缩矩阵转置压缩矩阵


CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr) {
	//Step 1. 申请空间
	int i, tempColumn, tempPosition;
	int *tempColumnCounts = (int *)malloc(paraPtr->columns * sizeof(int));
	int *tempOffsets = (int *)malloc(paraPtr->columns * sizeof(int));

	for (i = 0; i < paraPtr->columns; i ++) {

		tempColumnCounts[i] = 0;
	}


	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));

	//行列复值
	resultPtr->rows = paraPtr->columns;
	resultPtr->columns = paraPtr->rows;
	resultPtr->numElements = paraPtr->numElements;

	resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));

	//扫描计算.
	for (i = 0; i < paraPtr->numElements; i ++) {

		tempColumnCounts[paraPtr->elements[i].j] ++;
	}

	tempOffsets[0] = 0;
	//从1开始一一增加

	for (i = 1; i < paraPtr->columns; i ++) {

		tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
		printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
	}

	//Step 3. 同样扫描另外一个

	for (i = 0; i < paraPtr->numElements; i ++) {

		tempColumn = paraPtr->elements[i].j;
		tempPosition = tempOffsets[tempColumn];
		resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
		resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
		resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;

		tempOffsets[tempColumn]++;
	}

	//返回
	return resultPtr;
}

测试代码

void compressedMatrixTest() {
	CompressedMatrixPtr tempPtr1, tempPtr2;
	int i, j, tempElements;


	tempElements = 4;
	int **tempMatrix1 = (int **)malloc(tempElements * sizeof(int *));

	for (i = 0; i < tempElements; i ++) {

		tempMatrix1[i] = (int *)malloc(3 * sizeof(int));
	}

	int tempMatrix2[4][3] = {{0, 0, 2}, {0, 2, 3}, {2, 0, 5}, {2, 1, 6}};

	for (i = 0; i < tempElements; i ++) {

		for (j = 0; j < 3; j ++) {

			tempMatrix1[i][j] = tempMatrix2[i][j];
		}
	}

	tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);

	printf("After initialization.\r\n");
	printCompressedMatrix(tempPtr1);

	tempPtr2 = transposeCompressedMatrix(tempPtr1);
	printf("After transpose.\r\n");
	printCompressedMatrix(tempPtr2);
}


int main() {
	compressedMatrixTest();

	return 1;
}