压缩矩阵的转置

毕竟要转置，就是x成y，y成x，所以要先看y为0的值，然后传给下一个的x，这样才能把数据排好序。

压缩矩阵初始化：

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;   //矩阵里面有几个非0数据嗷
	resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple)); //空间申请嗷

	for(i = 0; i < paraElements; i ++){  //记录里面所有非0数据的x,y,和自己的值嗷
		resultPtr->elements[i].i = paraData[i][0];
		resultPtr->elements[i].j = paraData[i][1];
		resultPtr->elements[i].e = paraData[i][2];
	}

	return resultPtr;  //返回嗷
}

压缩矩阵操作：

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(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;
}

全部代码：

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

typedef int elem;

typedef struct Triple{   //压缩矩阵的x y 本身值的记录
    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;   //矩阵里面有几个非0数据嗷
	resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple)); //空间申请嗷

	for(i = 0; i < paraElements; i ++){  //记录里面所有非0数据的x,y,和自己的值嗷
		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){   //压缩矩阵的操作嗷
	
	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;
	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;
}

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

	
	tempElements = 6;
	int** tempMatrix1 = (int**)malloc(tempElements * sizeof(int*));
	for(i = 0; i < tempElements; i ++){
		tempMatrix1[i] = (int*)malloc(3 * sizeof(int));
	}

	int tempMatrix2[6][3] = {{0, 1, 2}, {1, 0, 3}, {1, 2, 5}, {2, 0, 1}, {3, 0, 7}, {3, 2, 1}};
	for(i = 0; i < tempElements; i ++){
		for(j = 0; j < 3; j ++) {
			tempMatrix1[i][j] = tempMatrix2[i][j];
		}
	}
	
	tempPtr1 = initCompressedMatrix(4, 3, 6, tempMatrix1);

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

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


int main(){
	compressedMatrixTest();

	return 1;
}

其实代码不用怎么看，只需要看懂上面的图就能理解代码了，但如果你图不懂的话，那代码理解起来就很难受了