压缩矩阵的转置

矩阵转置的实现思路是：不断遍历存储矩阵的三元组表，每次都取出表中 j 列最小的那一个三元组，互换行标和列标的值，并按次序存储到一个新三元组表中。

1.定义

typedef struct Triple{
	int i;
	int j;
	elem e;
}Triple, *TriplePtr;
 
 
 
//
typedef struct CompressedMatrix{
	int rows,columns,numElements;
	Triple* elements;
}CompressedMatrix, *CompressedMatrixPtr;

2.初始化

//初始化压缩矩阵
 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(int 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;
 }

3.打印

//打印
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);		
	} 
	
} 

4.转置

//转置压缩矩阵
CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr){
	//分配空间
	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(int i = 0;i < paraPtr->numElements;i ++){
		tempColumnCounts[paraPtr->elements[i].j] ++;
	}
	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]);	
	}
	
	//
	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;
} 
 

5.测试

//测试样例 
void compressedMatrixTest(){
	CompressedMatrixPtr tempPtr1, tempPtr2;
	int i, j, tempElements;
	
	//创建第一个样本矩阵
	tempElements = 4;
	int** tempMatrixd1 = (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];
		}//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); 
}

 设A为m×n阶矩阵（即m行n列），第i 行j 列的元素是a(i,j)，
把m×n矩阵A的行换成同序数的列得到一个n×m矩阵，此矩阵叫做A的转置矩阵。