1.概念
压缩矩阵的目的是通过一种紧凑的方式存储稀疏矩阵,以节省内存空间并提高计算效率。
2.代码
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<malloc.h>
#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];
}
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 = 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;
}
3.总结:
Triple
结构体定义了矩阵中的非零元素的行、列和值。CompressedMatrix
结构体定义了稀疏矩阵的基本信息,包括行数、列数、非零元素个数以及一个指向Triple
结构体数组的指针。initCompressedMatrix
函数用于初始化稀疏矩阵,将稀疏矩阵的信息存储到CompressedMatrixPtr
结构体指针中。printCompressedMatrix
函数用于打印稀疏矩阵的内容。transposeCompressedMatrix
函数实现了稀疏矩阵的转置操作,将原矩阵的列变为行,行变为列。compressedMatrixTest
函数用于测试稀疏矩阵的初始化和转置操作。