数据结构5.2--压缩矩阵的转置

一、代码

#include<stdio.h>
#include<malloc.h>

typedef int elem;

typedef struct Triple{
	int i;
	int j;
	elem e;
} Triple, *TriplePtr;

typedef struct CompressedMatrix{
	int rows, columns, numElements;
	Triple* elements;
}CompressedMatrix, *CompressedMatrixPtr;

/**
 * 初始化
 */
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];
	}//of for i
	
	return resultPtr;
} //of initCompressedMatrix

/**
 * 输出压缩矩阵
 */
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);
	}//of  for i
} //of printCompressedMatrix

/**
 * 转置矩阵
 */
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;
	} //of for i
	
	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));
	
	//step 2. 扫描
	for(i = 0; i < paraPtr->numElements; i ++){
		tempColumnCounts[paraPtr->elements[i].j] ++;
	} //of for i
	tempOffsets[0] = 0;
	for(i = 1; i < paraPtr->columns; i ++){
		tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
		printf("tempOffsets[%d] = %d \r\n",i, tempOffsets[i]);
	}//of for 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].j;
		resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;
		
		tempOffsets[tempColumn] ++;
	} //of for i
	
	return resultPtr;
} //of transposeCompressedMatrix

/**
 * test
 */
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));
	} //of for i
	
	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];
		}//of for j
	}//of for i
	
	tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);
	
	printf("After initialization.\r\n");
	printCompressedMatrix(tempPtr1);
	
	tempPtr2 = transposeCompressedMatrix(tempPtr1);
	printf("After transpose.\r\n");
	printCompressedMatrix(tempPtr2);
} //of compressedMatrixTest

int main(){
	CompressedMatrixTest();
	return 0;
}

二、运行结果

三、压缩矩阵：实质上是将一个二维数组的非零元素单独记录并储存与之对应的行和列。

压缩矩阵的转置：就是将压缩矩阵的行和列交换。实际就是将转置前的每一列的非零元素记录下来，然后在计算对应转置后的压缩矩阵的每一行对应的首元素的首个相对地址，然后将转置前的第i列赋值给第i行，但是若转置后的某一行已经赋值了一个元素，那么该行的首个元素的相对地址就要加1.